./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p2.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.vcegar_QF_BV_pj_icu_icctl_p2.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 7eccc5bbdbaf49f286af1eaa6e037aac70bd43bbdd029365a1ddd6424cc3712f
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-03 18:27:42,785 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-03 18:27:42,829 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf
[2025-03-03 18:27:42,833 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-03 18:27:42,833 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-03 18:27:42,854 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-03 18:27:42,856 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-03 18:27:42,856 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-03 18:27:42,856 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-03 18:27:42,857 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-03 18:27:42,857 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-03 18:27:42,857 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-03 18:27:42,858 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-03 18:27:42,858 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-03 18:27:42,858 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-03 18:27:42,858 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-03 18:27:42,858 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-03 18:27:42,859 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-03 18:27:42,859 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-03 18:27:42,859 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-03 18:27:42,859 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-03 18:27:42,859 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-03 18:27:42,859 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-03 18:27:42,859 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-03 18:27:42,859 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-03 18:27:42,859 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-03 18:27:42,859 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-03 18:27:42,860 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-03 18:27:42,860 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-03 18:27:42,860 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 18:27:42,860 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-03 18:27:42,860 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-03 18:27:42,860 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-03 18:27:42,861 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-03 18:27:42,861 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-03 18:27:42,861 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-03 18:27:42,861 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-03 18:27:42,861 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-03 18:27:42,861 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-03 18:27:42,861 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-03 18:27:42,861 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 -> 7eccc5bbdbaf49f286af1eaa6e037aac70bd43bbdd029365a1ddd6424cc3712f
[2025-03-03 18:27:43,105 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 18:27:43,114 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 18:27:43,117 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 18:27:43,118 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 18:27:43,118 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 18:27:43,119 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p2.c
[2025-03-03 18:27:44,383 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4acef2e2/37b039f001554a52865ca9478e4c06f0/FLAG779476798
[2025-03-03 18:27:44,713 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 18:27:44,714 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p2.c
[2025-03-03 18:27:44,733 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4acef2e2/37b039f001554a52865ca9478e4c06f0/FLAG779476798
[2025-03-03 18:27:44,747 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4acef2e2/37b039f001554a52865ca9478e4c06f0
[2025-03-03 18:27:44,750 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 18:27:44,751 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 18:27:44,752 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 18:27:44,752 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 18:27:44,755 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 18:27:44,756 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:27:44" (1/1) ...
[2025-03-03 18:27:44,756 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31f9c13c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:44, skipping insertion in model container
[2025-03-03 18:27:44,756 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:27:44" (1/1) ...
[2025-03-03 18:27:44,798 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 18:27:44,945 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.vcegar_QF_BV_pj_icu_icctl_p2.c[1268,1281]
[2025-03-03 18:27:45,197 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 18:27:45,204 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 18:27:45,211 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.vcegar_QF_BV_pj_icu_icctl_p2.c[1268,1281]
[2025-03-03 18:27:45,388 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 18:27:45,400 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 18:27:45,401 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:45 WrapperNode
[2025-03-03 18:27:45,402 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 18:27:45,403 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 18:27:45,403 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 18:27:45,403 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 18:27:45,409 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:45" (1/1) ...
[2025-03-03 18:27:45,447 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:45" (1/1) ...
[2025-03-03 18:27:45,877 INFO  L138                Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4880
[2025-03-03 18:27:45,877 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 18:27:45,878 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 18:27:45,878 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 18:27:45,878 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 18:27:45,885 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:45" (1/1) ...
[2025-03-03 18:27:45,886 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:45" (1/1) ...
[2025-03-03 18:27:45,948 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:45" (1/1) ...
[2025-03-03 18:27:46,089 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 18:27:46,090 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:45" (1/1) ...
[2025-03-03 18:27:46,090 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:45" (1/1) ...
[2025-03-03 18:27:46,177 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:45" (1/1) ...
[2025-03-03 18:27:46,191 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:45" (1/1) ...
[2025-03-03 18:27:46,213 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:45" (1/1) ...
[2025-03-03 18:27:46,242 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:45" (1/1) ...
[2025-03-03 18:27:46,294 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 18:27:46,295 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 18:27:46,296 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 18:27:46,296 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 18:27:46,297 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:45" (1/1) ...
[2025-03-03 18:27:46,301 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 18:27:46,311 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 18:27:46,324 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 18:27:46,328 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 18:27:46,346 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 18:27:46,346 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 18:27:46,346 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 18:27:46,346 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 18:27:46,707 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 18:27:46,709 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 18:27:50,098 INFO  L?                        ?]: Removed 3163 outVars from TransFormulas that were not future-live.
[2025-03-03 18:27:50,098 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 18:27:50,207 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 18:27:50,208 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 18:27:50,208 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:27:50 BoogieIcfgContainer
[2025-03-03 18:27:50,208 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 18:27:50,210 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 18:27:50,210 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 18:27:50,213 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 18:27:50,214 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:27:44" (1/3) ...
[2025-03-03 18:27:50,214 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@609ec928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:27:50, skipping insertion in model container
[2025-03-03 18:27:50,214 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:27:45" (2/3) ...
[2025-03-03 18:27:50,214 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@609ec928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:27:50, skipping insertion in model container
[2025-03-03 18:27:50,214 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:27:50" (3/3) ...
[2025-03-03 18:27:50,215 INFO  L128   eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p2.c
[2025-03-03 18:27:50,226 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 18:27:50,228 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p2.c that has 1 procedures, 1130 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 18:27:50,275 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 18:27:50,283 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;@3112392c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 18:27:50,283 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 18:27:50,288 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 1130 states, 1128 states have (on average 1.499113475177305) internal successors, (1691), 1129 states have internal predecessors, (1691), 0 states have call successors, (0), 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 18:27:50,294 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2025-03-03 18:27:50,294 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:27:50,295 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 18:27:50,295 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:27:50,299 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:27:50,299 INFO  L85        PathProgramCache]: Analyzing trace with hash -890080077, now seen corresponding path program 1 times
[2025-03-03 18:27:50,304 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:27:50,305 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524414820]
[2025-03-03 18:27:50,305 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:27:50,305 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:27:50,393 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes.
[2025-03-03 18:27:50,524 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements.
[2025-03-03 18:27:50,524 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:27:50,524 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:27:51,202 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 18:27:51,204 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:27:51,204 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524414820]
[2025-03-03 18:27:51,204 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524414820] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:27:51,204 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:27:51,205 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 18:27:51,206 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272913448]
[2025-03-03 18:27:51,206 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:27:51,209 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 18:27:51,210 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:27:51,222 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 18:27:51,223 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 18:27:51,226 INFO  L87              Difference]: Start difference. First operand  has 1130 states, 1128 states have (on average 1.499113475177305) internal successors, (1691), 1129 states have internal predecessors, (1691), 0 states have call successors, (0), 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 22.75) internal successors, (91), 4 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 18:27:51,848 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:27:51,849 INFO  L93              Difference]: Finished difference Result 2141 states and 3207 transitions.
[2025-03-03 18:27:51,850 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 18:27:51,851 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 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 18:27:51,851 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:27:51,867 INFO  L225             Difference]: With dead ends: 2141
[2025-03-03 18:27:51,868 INFO  L226             Difference]: Without dead ends: 1129
[2025-03-03 18:27:51,874 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 18:27:51,878 INFO  L435           NwaCegarLoop]: 1405 mSDtfsCounter, 0 mSDsluCounter, 2805 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4210 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 18:27:51,880 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4210 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 18:27:51,897 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1129 states.
[2025-03-03 18:27:51,948 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1129.
[2025-03-03 18:27:51,951 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1129 states, 1128 states have (on average 1.497340425531915) internal successors, (1689), 1128 states have internal predecessors, (1689), 0 states have call successors, (0), 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 18:27:51,959 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1689 transitions.
[2025-03-03 18:27:51,961 INFO  L78                 Accepts]: Start accepts. Automaton has 1129 states and 1689 transitions. Word has length 91
[2025-03-03 18:27:51,962 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:27:51,962 INFO  L471      AbstractCegarLoop]: Abstraction has 1129 states and 1689 transitions.
[2025-03-03 18:27:51,962 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 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 18:27:51,962 INFO  L276                IsEmpty]: Start isEmpty. Operand 1129 states and 1689 transitions.
[2025-03-03 18:27:51,965 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 93
[2025-03-03 18:27:51,965 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:27:51,965 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 18:27:51,966 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-03 18:27:51,966 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:27:51,966 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:27:51,967 INFO  L85        PathProgramCache]: Analyzing trace with hash -1817997807, now seen corresponding path program 1 times
[2025-03-03 18:27:51,967 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:27:51,967 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365525030]
[2025-03-03 18:27:51,967 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:27:51,967 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:27:52,022 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes.
[2025-03-03 18:27:52,054 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements.
[2025-03-03 18:27:52,055 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:27:52,055 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:27:52,290 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 18:27:52,290 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:27:52,290 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365525030]
[2025-03-03 18:27:52,290 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365525030] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:27:52,290 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:27:52,290 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 18:27:52,290 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126972715]
[2025-03-03 18:27:52,290 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:27:52,291 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 18:27:52,291 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:27:52,292 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 18:27:52,292 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 18:27:52,292 INFO  L87              Difference]: Start difference. First operand 1129 states and 1689 transitions. Second operand  has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 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 18:27:52,795 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:27:52,795 INFO  L93              Difference]: Finished difference Result 2142 states and 3205 transitions.
[2025-03-03 18:27:52,795 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 18:27:52,796 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 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 18:27:52,796 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:27:52,801 INFO  L225             Difference]: With dead ends: 2142
[2025-03-03 18:27:52,801 INFO  L226             Difference]: Without dead ends: 1131
[2025-03-03 18:27:52,805 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 18:27:52,806 INFO  L435           NwaCegarLoop]: 1405 mSDtfsCounter, 0 mSDsluCounter, 2802 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4207 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 18:27:52,807 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4207 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 18:27:52,810 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1131 states.
[2025-03-03 18:27:52,828 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 1131.
[2025-03-03 18:27:52,830 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1131 states, 1130 states have (on average 1.4964601769911505) internal successors, (1691), 1130 states have internal predecessors, (1691), 0 states have call successors, (0), 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 18:27:52,833 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1691 transitions.
[2025-03-03 18:27:52,833 INFO  L78                 Accepts]: Start accepts. Automaton has 1131 states and 1691 transitions. Word has length 92
[2025-03-03 18:27:52,833 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:27:52,834 INFO  L471      AbstractCegarLoop]: Abstraction has 1131 states and 1691 transitions.
[2025-03-03 18:27:52,834 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 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 18:27:52,834 INFO  L276                IsEmpty]: Start isEmpty. Operand 1131 states and 1691 transitions.
[2025-03-03 18:27:52,835 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2025-03-03 18:27:52,835 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:27:52,835 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 18:27:52,835 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 18:27:52,835 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:27:52,836 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:27:52,836 INFO  L85        PathProgramCache]: Analyzing trace with hash 1408153710, now seen corresponding path program 1 times
[2025-03-03 18:27:52,836 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:27:52,836 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999424745]
[2025-03-03 18:27:52,836 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:27:52,836 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:27:52,895 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes.
[2025-03-03 18:27:53,035 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements.
[2025-03-03 18:27:53,036 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:27:53,036 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:27:53,480 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 18:27:53,480 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:27:53,481 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999424745]
[2025-03-03 18:27:53,481 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999424745] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:27:53,481 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:27:53,481 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-03 18:27:53,481 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82147622]
[2025-03-03 18:27:53,481 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:27:53,481 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-03 18:27:53,482 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:27:53,482 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-03 18:27:53,483 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-03-03 18:27:53,483 INFO  L87              Difference]: Start difference. First operand 1131 states and 1691 transitions. Second operand  has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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 18:27:54,154 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:27:54,155 INFO  L93              Difference]: Finished difference Result 2148 states and 3212 transitions.
[2025-03-03 18:27:54,156 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-03 18:27:54,156 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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 18:27:54,156 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:27:54,161 INFO  L225             Difference]: With dead ends: 2148
[2025-03-03 18:27:54,161 INFO  L226             Difference]: Without dead ends: 1135
[2025-03-03 18:27:54,164 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-03 18:27:54,166 INFO  L435           NwaCegarLoop]: 1399 mSDtfsCounter, 1610 mSDsluCounter, 4188 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1610 SdHoareTripleChecker+Valid, 5587 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 18:27:54,166 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1610 Valid, 5587 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 18:27:54,211 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1135 states.
[2025-03-03 18:27:54,228 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 1134.
[2025-03-03 18:27:54,230 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1134 states, 1133 states have (on average 1.4951456310679612) internal successors, (1694), 1133 states have internal predecessors, (1694), 0 states have call successors, (0), 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 18:27:54,233 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1694 transitions.
[2025-03-03 18:27:54,233 INFO  L78                 Accepts]: Start accepts. Automaton has 1134 states and 1694 transitions. Word has length 93
[2025-03-03 18:27:54,233 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:27:54,233 INFO  L471      AbstractCegarLoop]: Abstraction has 1134 states and 1694 transitions.
[2025-03-03 18:27:54,233 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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 18:27:54,233 INFO  L276                IsEmpty]: Start isEmpty. Operand 1134 states and 1694 transitions.
[2025-03-03 18:27:54,234 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 95
[2025-03-03 18:27:54,234 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:27:54,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 18:27:54,234 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-03 18:27:54,234 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:27:54,234 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:27:54,234 INFO  L85        PathProgramCache]: Analyzing trace with hash 1723994197, now seen corresponding path program 1 times
[2025-03-03 18:27:54,235 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:27:54,235 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821724981]
[2025-03-03 18:27:54,235 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:27:54,235 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:27:54,270 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes.
[2025-03-03 18:27:54,328 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements.
[2025-03-03 18:27:54,328 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:27:54,328 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:27:54,963 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 18:27:54,963 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:27:54,963 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821724981]
[2025-03-03 18:27:54,963 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821724981] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:27:54,963 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:27:54,963 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 18:27:54,963 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423449690]
[2025-03-03 18:27:54,963 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:27:54,963 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 18:27:54,963 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:27:54,964 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 18:27:54,964 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 18:27:54,964 INFO  L87              Difference]: Start difference. First operand 1134 states and 1694 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 18:27:55,531 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:27:55,531 INFO  L93              Difference]: Finished difference Result 2195 states and 3279 transitions.
[2025-03-03 18:27:55,532 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 18:27:55,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 18:27:55,532 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:27:55,535 INFO  L225             Difference]: With dead ends: 2195
[2025-03-03 18:27:55,535 INFO  L226             Difference]: Without dead ends: 1179
[2025-03-03 18:27:55,537 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 18:27:55,537 INFO  L435           NwaCegarLoop]: 1388 mSDtfsCounter, 1756 mSDsluCounter, 2774 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1756 SdHoareTripleChecker+Valid, 4162 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 18:27:55,538 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1756 Valid, 4162 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 18:27:55,539 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1179 states.
[2025-03-03 18:27:55,552 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1140.
[2025-03-03 18:27:55,554 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1140 states, 1139 states have (on average 1.4942932396839332) internal successors, (1702), 1139 states have internal predecessors, (1702), 0 states have call successors, (0), 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 18:27:55,557 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1702 transitions.
[2025-03-03 18:27:55,557 INFO  L78                 Accepts]: Start accepts. Automaton has 1140 states and 1702 transitions. Word has length 94
[2025-03-03 18:27:55,557 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:27:55,557 INFO  L471      AbstractCegarLoop]: Abstraction has 1140 states and 1702 transitions.
[2025-03-03 18:27:55,557 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 18:27:55,558 INFO  L276                IsEmpty]: Start isEmpty. Operand 1140 states and 1702 transitions.
[2025-03-03 18:27:55,558 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 96
[2025-03-03 18:27:55,558 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:27:55,558 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 18:27:55,558 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-03 18:27:55,558 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:27:55,559 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:27:55,559 INFO  L85        PathProgramCache]: Analyzing trace with hash 1008409467, now seen corresponding path program 1 times
[2025-03-03 18:27:55,559 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:27:55,559 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030875088]
[2025-03-03 18:27:55,559 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:27:55,559 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:27:55,596 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes.
[2025-03-03 18:27:55,640 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements.
[2025-03-03 18:27:55,640 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:27:55,640 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:27:56,107 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 18:27:56,107 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:27:56,107 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030875088]
[2025-03-03 18:27:56,107 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030875088] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:27:56,107 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:27:56,107 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-03 18:27:56,107 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126476994]
[2025-03-03 18:27:56,107 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:27:56,107 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-03 18:27:56,107 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:27:56,108 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-03 18:27:56,108 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-03-03 18:27:56,108 INFO  L87              Difference]: Start difference. First operand 1140 states and 1702 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 18:27:56,834 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:27:56,834 INFO  L93              Difference]: Finished difference Result 2176 states and 3250 transitions.
[2025-03-03 18:27:56,834 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-03 18:27:56,834 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 18:27:56,835 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:27:56,839 INFO  L225             Difference]: With dead ends: 2176
[2025-03-03 18:27:56,839 INFO  L226             Difference]: Without dead ends: 1160
[2025-03-03 18:27:56,840 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-03-03 18:27:56,841 INFO  L435           NwaCegarLoop]: 1400 mSDtfsCounter, 19 mSDsluCounter, 5606 mSDsCounter, 0 mSdLazyCounter, 1449 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 7006 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 18:27:56,841 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 7006 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1449 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 18:27:56,842 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1160 states.
[2025-03-03 18:27:56,855 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1157.
[2025-03-03 18:27:56,857 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1157 states, 1156 states have (on average 1.4930795847750864) internal successors, (1726), 1156 states have internal predecessors, (1726), 0 states have call successors, (0), 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 18:27:56,860 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1726 transitions.
[2025-03-03 18:27:56,860 INFO  L78                 Accepts]: Start accepts. Automaton has 1157 states and 1726 transitions. Word has length 95
[2025-03-03 18:27:56,860 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:27:56,860 INFO  L471      AbstractCegarLoop]: Abstraction has 1157 states and 1726 transitions.
[2025-03-03 18:27:56,860 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 18:27:56,861 INFO  L276                IsEmpty]: Start isEmpty. Operand 1157 states and 1726 transitions.
[2025-03-03 18:27:56,861 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2025-03-03 18:27:56,861 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:27:56,861 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 18:27:56,861 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-03 18:27:56,862 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:27:56,862 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:27:56,862 INFO  L85        PathProgramCache]: Analyzing trace with hash -227194711, now seen corresponding path program 1 times
[2025-03-03 18:27:56,862 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:27:56,862 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813771063]
[2025-03-03 18:27:56,862 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:27:56,862 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:27:56,895 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes.
[2025-03-03 18:27:56,913 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements.
[2025-03-03 18:27:56,913 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:27:56,913 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:27:57,249 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 18:27:57,249 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:27:57,249 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813771063]
[2025-03-03 18:27:57,249 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813771063] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:27:57,249 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:27:57,249 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-03 18:27:57,249 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45346221]
[2025-03-03 18:27:57,250 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:27:57,250 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-03 18:27:57,250 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:27:57,250 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-03 18:27:57,250 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-03-03 18:27:57,250 INFO  L87              Difference]: Start difference. First operand 1157 states and 1726 transitions. Second operand  has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 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 18:27:58,117 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:27:58,118 INFO  L93              Difference]: Finished difference Result 2244 states and 3347 transitions.
[2025-03-03 18:27:58,118 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-03 18:27:58,118 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 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 18:27:58,119 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:27:58,122 INFO  L225             Difference]: With dead ends: 2244
[2025-03-03 18:27:58,122 INFO  L226             Difference]: Without dead ends: 1211
[2025-03-03 18:27:58,123 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2025-03-03 18:27:58,124 INFO  L435           NwaCegarLoop]: 1388 mSDtfsCounter, 1758 mSDsluCounter, 5541 mSDsCounter, 0 mSdLazyCounter, 1506 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1758 SdHoareTripleChecker+Valid, 6929 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-03 18:27:58,124 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1758 Valid, 6929 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1506 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-03 18:27:58,126 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1211 states.
[2025-03-03 18:27:58,139 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1187.
[2025-03-03 18:27:58,141 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1187 states, 1186 states have (on average 1.4915682967959527) internal successors, (1769), 1186 states have internal predecessors, (1769), 0 states have call successors, (0), 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 18:27:58,144 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1769 transitions.
[2025-03-03 18:27:58,144 INFO  L78                 Accepts]: Start accepts. Automaton has 1187 states and 1769 transitions. Word has length 96
[2025-03-03 18:27:58,144 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:27:58,144 INFO  L471      AbstractCegarLoop]: Abstraction has 1187 states and 1769 transitions.
[2025-03-03 18:27:58,145 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 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 18:27:58,145 INFO  L276                IsEmpty]: Start isEmpty. Operand 1187 states and 1769 transitions.
[2025-03-03 18:27:58,145 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2025-03-03 18:27:58,145 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:27:58,145 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 18:27:58,145 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-03 18:27:58,145 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:27:58,146 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:27:58,146 INFO  L85        PathProgramCache]: Analyzing trace with hash -132282706, now seen corresponding path program 1 times
[2025-03-03 18:27:58,146 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:27:58,146 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429791735]
[2025-03-03 18:27:58,146 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:27:58,146 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:27:58,182 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes.
[2025-03-03 18:27:58,228 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements.
[2025-03-03 18:27:58,229 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:27:58,229 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:27:58,721 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 18:27:58,721 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:27:58,721 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429791735]
[2025-03-03 18:27:58,721 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429791735] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:27:58,721 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:27:58,721 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-03-03 18:27:58,721 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397049352]
[2025-03-03 18:27:58,721 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:27:58,722 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-03 18:27:58,722 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:27:58,722 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-03 18:27:58,722 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2025-03-03 18:27:58,722 INFO  L87              Difference]: Start difference. First operand 1187 states and 1769 transitions. Second operand  has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 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 18:27:59,393 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:27:59,393 INFO  L93              Difference]: Finished difference Result 2248 states and 3351 transitions.
[2025-03-03 18:27:59,393 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-03 18:27:59,394 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 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 18:27:59,394 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:27:59,397 INFO  L225             Difference]: With dead ends: 2248
[2025-03-03 18:27:59,397 INFO  L226             Difference]: Without dead ends: 1215
[2025-03-03 18:27:59,398 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272
[2025-03-03 18:27:59,399 INFO  L435           NwaCegarLoop]: 1382 mSDtfsCounter, 1806 mSDsluCounter, 2950 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1806 SdHoareTripleChecker+Valid, 4332 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 18:27:59,399 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1806 Valid, 4332 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 18:27:59,400 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1215 states.
[2025-03-03 18:27:59,412 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1192.
[2025-03-03 18:27:59,413 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1192 states, 1191 states have (on average 1.489504617968094) internal successors, (1774), 1191 states have internal predecessors, (1774), 0 states have call successors, (0), 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 18:27:59,416 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1774 transitions.
[2025-03-03 18:27:59,416 INFO  L78                 Accepts]: Start accepts. Automaton has 1192 states and 1774 transitions. Word has length 96
[2025-03-03 18:27:59,416 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:27:59,416 INFO  L471      AbstractCegarLoop]: Abstraction has 1192 states and 1774 transitions.
[2025-03-03 18:27:59,416 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 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 18:27:59,417 INFO  L276                IsEmpty]: Start isEmpty. Operand 1192 states and 1774 transitions.
[2025-03-03 18:27:59,417 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2025-03-03 18:27:59,417 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:27:59,417 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 18:27:59,417 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-03 18:27:59,417 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:27:59,417 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:27:59,418 INFO  L85        PathProgramCache]: Analyzing trace with hash 1417813231, now seen corresponding path program 1 times
[2025-03-03 18:27:59,418 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:27:59,418 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236607406]
[2025-03-03 18:27:59,418 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:27:59,418 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:27:59,449 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes.
[2025-03-03 18:27:59,475 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements.
[2025-03-03 18:27:59,476 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:27:59,476 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:27:59,813 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 18:27:59,814 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:27:59,814 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236607406]
[2025-03-03 18:27:59,814 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236607406] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:27:59,814 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:27:59,814 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 18:27:59,814 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756148460]
[2025-03-03 18:27:59,814 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:27:59,815 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 18:27:59,815 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:27:59,815 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 18:27:59,815 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 18:27:59,815 INFO  L87              Difference]: Start difference. First operand 1192 states and 1774 transitions. Second operand  has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 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 18:28:00,392 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:28:00,393 INFO  L93              Difference]: Finished difference Result 2240 states and 3338 transitions.
[2025-03-03 18:28:00,393 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 18:28:00,393 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 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 18:28:00,393 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:28:00,396 INFO  L225             Difference]: With dead ends: 2240
[2025-03-03 18:28:00,396 INFO  L226             Difference]: Without dead ends: 1192
[2025-03-03 18:28:00,398 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-03 18:28:00,398 INFO  L435           NwaCegarLoop]: 1389 mSDtfsCounter, 1737 mSDsluCounter, 2775 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1737 SdHoareTripleChecker+Valid, 4164 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 18:28:00,398 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1737 Valid, 4164 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 18:28:00,400 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1192 states.
[2025-03-03 18:28:00,415 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1177.
[2025-03-03 18:28:00,416 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1177 states, 1176 states have (on average 1.489795918367347) internal successors, (1752), 1176 states have internal predecessors, (1752), 0 states have call successors, (0), 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 18:28:00,419 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1752 transitions.
[2025-03-03 18:28:00,420 INFO  L78                 Accepts]: Start accepts. Automaton has 1177 states and 1752 transitions. Word has length 96
[2025-03-03 18:28:00,420 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:28:00,420 INFO  L471      AbstractCegarLoop]: Abstraction has 1177 states and 1752 transitions.
[2025-03-03 18:28:00,420 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 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 18:28:00,420 INFO  L276                IsEmpty]: Start isEmpty. Operand 1177 states and 1752 transitions.
[2025-03-03 18:28:00,421 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 98
[2025-03-03 18:28:00,421 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:28:00,421 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 18:28:00,421 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-03 18:28:00,422 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:28:00,422 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:28:00,423 INFO  L85        PathProgramCache]: Analyzing trace with hash -392004320, now seen corresponding path program 1 times
[2025-03-03 18:28:00,424 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:28:00,424 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670491136]
[2025-03-03 18:28:00,424 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:28:00,424 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:28:00,460 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes.
[2025-03-03 18:28:00,508 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements.
[2025-03-03 18:28:00,508 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:28:00,511 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:28:01,301 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 18:28:01,301 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:28:01,301 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670491136]
[2025-03-03 18:28:01,301 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670491136] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:28:01,301 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:28:01,301 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2025-03-03 18:28:01,301 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358703846]
[2025-03-03 18:28:01,301 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:28:01,302 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2025-03-03 18:28:01,302 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:28:01,302 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2025-03-03 18:28:01,302 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210
[2025-03-03 18:28:01,302 INFO  L87              Difference]: Start difference. First operand 1177 states and 1752 transitions. Second operand  has 15 states, 15 states have (on average 6.466666666666667) internal successors, (97), 15 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 18:28:02,375 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:28:02,375 INFO  L93              Difference]: Finished difference Result 2232 states and 3327 transitions.
[2025-03-03 18:28:02,376 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-03-03 18:28:02,376 INFO  L78                 Accepts]: Start accepts. Automaton has  has 15 states, 15 states have (on average 6.466666666666667) internal successors, (97), 15 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 18:28:02,376 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:28:02,379 INFO  L225             Difference]: With dead ends: 2232
[2025-03-03 18:28:02,379 INFO  L226             Difference]: Without dead ends: 1199
[2025-03-03 18:28:02,380 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650
[2025-03-03 18:28:02,382 INFO  L435           NwaCegarLoop]: 1378 mSDtfsCounter, 1751 mSDsluCounter, 7046 mSDsCounter, 0 mSdLazyCounter, 2011 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1751 SdHoareTripleChecker+Valid, 8424 SdHoareTripleChecker+Invalid, 2014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-03 18:28:02,382 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1751 Valid, 8424 Invalid, 2014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2011 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-03 18:28:02,383 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1199 states.
[2025-03-03 18:28:02,394 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 1184.
[2025-03-03 18:28:02,396 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1184 states, 1183 states have (on average 1.4894336432797972) internal successors, (1762), 1183 states have internal predecessors, (1762), 0 states have call successors, (0), 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 18:28:02,397 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1762 transitions.
[2025-03-03 18:28:02,397 INFO  L78                 Accepts]: Start accepts. Automaton has 1184 states and 1762 transitions. Word has length 97
[2025-03-03 18:28:02,397 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:28:02,397 INFO  L471      AbstractCegarLoop]: Abstraction has 1184 states and 1762 transitions.
[2025-03-03 18:28:02,398 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 6.466666666666667) internal successors, (97), 15 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 18:28:02,398 INFO  L276                IsEmpty]: Start isEmpty. Operand 1184 states and 1762 transitions.
[2025-03-03 18:28:02,398 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 99
[2025-03-03 18:28:02,398 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:28:02,398 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 18:28:02,398 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-03 18:28:02,398 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:28:02,401 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:28:02,401 INFO  L85        PathProgramCache]: Analyzing trace with hash 1533973439, now seen corresponding path program 1 times
[2025-03-03 18:28:02,401 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:28:02,401 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84762612]
[2025-03-03 18:28:02,401 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:28:02,401 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:28:02,431 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes.
[2025-03-03 18:28:02,450 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements.
[2025-03-03 18:28:02,450 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:28:02,450 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:28:02,659 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 18:28:02,659 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:28:02,659 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84762612]
[2025-03-03 18:28:02,659 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84762612] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:28:02,659 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:28:02,659 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 18:28:02,659 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960640045]
[2025-03-03 18:28:02,660 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:28:02,660 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 18:28:02,660 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:28:02,660 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 18:28:02,660 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 18:28:02,660 INFO  L87              Difference]: Start difference. First operand 1184 states and 1762 transitions. Second operand  has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 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 18:28:03,156 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:28:03,156 INFO  L93              Difference]: Finished difference Result 2227 states and 3318 transitions.
[2025-03-03 18:28:03,156 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 18:28:03,156 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 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 98
[2025-03-03 18:28:03,157 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:28:03,159 INFO  L225             Difference]: With dead ends: 2227
[2025-03-03 18:28:03,159 INFO  L226             Difference]: Without dead ends: 1194
[2025-03-03 18:28:03,160 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-03 18:28:03,161 INFO  L435           NwaCegarLoop]: 1388 mSDtfsCounter, 1719 mSDsluCounter, 2773 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1719 SdHoareTripleChecker+Valid, 4161 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 18:28:03,161 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1719 Valid, 4161 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 18:28:03,162 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1194 states.
[2025-03-03 18:28:03,171 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1184.
[2025-03-03 18:28:03,172 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1184 states, 1183 states have (on average 1.4885883347421809) internal successors, (1761), 1183 states have internal predecessors, (1761), 0 states have call successors, (0), 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 18:28:03,174 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1761 transitions.
[2025-03-03 18:28:03,174 INFO  L78                 Accepts]: Start accepts. Automaton has 1184 states and 1761 transitions. Word has length 98
[2025-03-03 18:28:03,174 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:28:03,174 INFO  L471      AbstractCegarLoop]: Abstraction has 1184 states and 1761 transitions.
[2025-03-03 18:28:03,174 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 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 18:28:03,174 INFO  L276                IsEmpty]: Start isEmpty. Operand 1184 states and 1761 transitions.
[2025-03-03 18:28:03,175 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 99
[2025-03-03 18:28:03,175 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:28:03,175 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 18:28:03,175 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-03 18:28:03,175 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:28:03,175 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:28:03,175 INFO  L85        PathProgramCache]: Analyzing trace with hash 1936900920, now seen corresponding path program 1 times
[2025-03-03 18:28:03,175 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:28:03,175 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121667048]
[2025-03-03 18:28:03,175 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:28:03,175 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:28:03,207 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes.
[2025-03-03 18:28:03,227 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements.
[2025-03-03 18:28:03,227 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:28:03,227 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:28:03,509 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 18:28:03,510 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:28:03,510 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121667048]
[2025-03-03 18:28:03,510 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121667048] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:28:03,510 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:28:03,510 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-03 18:28:03,510 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811488190]
[2025-03-03 18:28:03,510 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:28:03,510 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-03 18:28:03,510 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:28:03,511 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-03 18:28:03,511 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-03-03 18:28:03,511 INFO  L87              Difference]: Start difference. First operand 1184 states and 1761 transitions. Second operand  has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 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 18:28:04,057 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:28:04,057 INFO  L93              Difference]: Finished difference Result 2230 states and 3320 transitions.
[2025-03-03 18:28:04,057 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-03 18:28:04,058 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 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 98
[2025-03-03 18:28:04,058 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:28:04,060 INFO  L225             Difference]: With dead ends: 2230
[2025-03-03 18:28:04,060 INFO  L226             Difference]: Without dead ends: 1194
[2025-03-03 18:28:04,061 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110
[2025-03-03 18:28:04,062 INFO  L435           NwaCegarLoop]: 1386 mSDtfsCounter, 1716 mSDsluCounter, 2841 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1716 SdHoareTripleChecker+Valid, 4227 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 18:28:04,062 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1716 Valid, 4227 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 18:28:04,063 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1194 states.
[2025-03-03 18:28:04,072 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1184.
[2025-03-03 18:28:04,073 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1184 states, 1183 states have (on average 1.4877430262045646) internal successors, (1760), 1183 states have internal predecessors, (1760), 0 states have call successors, (0), 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 18:28:04,075 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1760 transitions.
[2025-03-03 18:28:04,075 INFO  L78                 Accepts]: Start accepts. Automaton has 1184 states and 1760 transitions. Word has length 98
[2025-03-03 18:28:04,075 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:28:04,075 INFO  L471      AbstractCegarLoop]: Abstraction has 1184 states and 1760 transitions.
[2025-03-03 18:28:04,075 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 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 18:28:04,075 INFO  L276                IsEmpty]: Start isEmpty. Operand 1184 states and 1760 transitions.
[2025-03-03 18:28:04,076 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2025-03-03 18:28:04,076 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:28:04,076 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 18:28:04,076 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-03 18:28:04,076 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:28:04,076 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:28:04,077 INFO  L85        PathProgramCache]: Analyzing trace with hash 1060826437, now seen corresponding path program 1 times
[2025-03-03 18:28:04,077 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:28:04,077 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931482858]
[2025-03-03 18:28:04,077 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:28:04,077 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:28:04,104 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes.
[2025-03-03 18:28:04,124 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements.
[2025-03-03 18:28:04,124 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:28:04,124 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:28:04,460 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 18:28:04,461 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:28:04,461 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931482858]
[2025-03-03 18:28:04,461 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931482858] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:28:04,461 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:28:04,461 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-03-03 18:28:04,461 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657206909]
[2025-03-03 18:28:04,461 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:28:04,461 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-03 18:28:04,461 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:28:04,461 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-03 18:28:04,461 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2025-03-03 18:28:04,462 INFO  L87              Difference]: Start difference. First operand 1184 states and 1760 transitions. Second operand  has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 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 18:28:05,328 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:28:05,328 INFO  L93              Difference]: Finished difference Result 2231 states and 3322 transitions.
[2025-03-03 18:28:05,328 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-03 18:28:05,328 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 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 99
[2025-03-03 18:28:05,328 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:28:05,331 INFO  L225             Difference]: With dead ends: 2231
[2025-03-03 18:28:05,331 INFO  L226             Difference]: Without dead ends: 1198
[2025-03-03 18:28:05,332 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210
[2025-03-03 18:28:05,333 INFO  L435           NwaCegarLoop]: 1383 mSDtfsCounter, 1726 mSDsluCounter, 8287 mSDsCounter, 0 mSdLazyCounter, 2139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1726 SdHoareTripleChecker+Valid, 9670 SdHoareTripleChecker+Invalid, 2139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-03 18:28:05,333 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1726 Valid, 9670 Invalid, 2139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2139 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-03 18:28:05,334 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1198 states.
[2025-03-03 18:28:05,342 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1186.
[2025-03-03 18:28:05,343 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1186 states, 1185 states have (on average 1.4869198312236287) internal successors, (1762), 1185 states have internal predecessors, (1762), 0 states have call successors, (0), 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 18:28:05,344 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1762 transitions.
[2025-03-03 18:28:05,344 INFO  L78                 Accepts]: Start accepts. Automaton has 1186 states and 1762 transitions. Word has length 99
[2025-03-03 18:28:05,344 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:28:05,344 INFO  L471      AbstractCegarLoop]: Abstraction has 1186 states and 1762 transitions.
[2025-03-03 18:28:05,344 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 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 18:28:05,344 INFO  L276                IsEmpty]: Start isEmpty. Operand 1186 states and 1762 transitions.
[2025-03-03 18:28:05,345 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2025-03-03 18:28:05,345 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:28:05,345 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 18:28:05,345 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-03 18:28:05,345 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:28:05,345 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:28:05,345 INFO  L85        PathProgramCache]: Analyzing trace with hash 1501562545, now seen corresponding path program 1 times
[2025-03-03 18:28:05,345 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:28:05,345 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546190320]
[2025-03-03 18:28:05,346 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:28:05,346 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:28:05,371 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes.
[2025-03-03 18:28:05,385 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements.
[2025-03-03 18:28:05,385 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:28:05,385 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:28:05,581 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 18:28:05,581 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:28:05,581 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546190320]
[2025-03-03 18:28:05,581 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546190320] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:28:05,581 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:28:05,582 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 18:28:05,582 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692208375]
[2025-03-03 18:28:05,582 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:28:05,582 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 18:28:05,582 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:28:05,582 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 18:28:05,582 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 18:28:05,583 INFO  L87              Difference]: Start difference. First operand 1186 states and 1762 transitions. Second operand  has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 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 18:28:06,115 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:28:06,115 INFO  L93              Difference]: Finished difference Result 2222 states and 3308 transitions.
[2025-03-03 18:28:06,116 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 18:28:06,116 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 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 99
[2025-03-03 18:28:06,116 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:28:06,118 INFO  L225             Difference]: With dead ends: 2222
[2025-03-03 18:28:06,118 INFO  L226             Difference]: Without dead ends: 1189
[2025-03-03 18:28:06,119 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-03 18:28:06,120 INFO  L435           NwaCegarLoop]: 1388 mSDtfsCounter, 1702 mSDsluCounter, 2773 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1702 SdHoareTripleChecker+Valid, 4161 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 18:28:06,120 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1702 Valid, 4161 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 18:28:06,121 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1189 states.
[2025-03-03 18:28:06,129 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1186.
[2025-03-03 18:28:06,130 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1186 states, 1185 states have (on average 1.4860759493670885) internal successors, (1761), 1185 states have internal predecessors, (1761), 0 states have call successors, (0), 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 18:28:06,132 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1761 transitions.
[2025-03-03 18:28:06,132 INFO  L78                 Accepts]: Start accepts. Automaton has 1186 states and 1761 transitions. Word has length 99
[2025-03-03 18:28:06,132 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:28:06,132 INFO  L471      AbstractCegarLoop]: Abstraction has 1186 states and 1761 transitions.
[2025-03-03 18:28:06,132 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 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 18:28:06,132 INFO  L276                IsEmpty]: Start isEmpty. Operand 1186 states and 1761 transitions.
[2025-03-03 18:28:06,133 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 101
[2025-03-03 18:28:06,133 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:28:06,133 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 18:28:06,134 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-03 18:28:06,134 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:28:06,134 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:28:06,134 INFO  L85        PathProgramCache]: Analyzing trace with hash -520262984, now seen corresponding path program 1 times
[2025-03-03 18:28:06,134 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:28:06,134 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133578729]
[2025-03-03 18:28:06,134 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:28:06,134 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:28:06,161 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes.
[2025-03-03 18:28:06,186 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements.
[2025-03-03 18:28:06,186 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:28:06,186 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:28:06,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 18:28:06,523 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:28:06,523 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133578729]
[2025-03-03 18:28:06,523 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133578729] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:28:06,523 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:28:06,523 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-03 18:28:06,523 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735386298]
[2025-03-03 18:28:06,523 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:28:06,523 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-03 18:28:06,524 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:28:06,524 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-03 18:28:06,524 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-03-03 18:28:06,524 INFO  L87              Difference]: Start difference. First operand 1186 states and 1761 transitions. Second operand  has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 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 18:28:07,057 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:28:07,057 INFO  L93              Difference]: Finished difference Result 2226 states and 3313 transitions.
[2025-03-03 18:28:07,057 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-03 18:28:07,057 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 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 100
[2025-03-03 18:28:07,058 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:28:07,060 INFO  L225             Difference]: With dead ends: 2226
[2025-03-03 18:28:07,060 INFO  L226             Difference]: Without dead ends: 1193
[2025-03-03 18:28:07,061 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110
[2025-03-03 18:28:07,062 INFO  L435           NwaCegarLoop]: 1386 mSDtfsCounter, 1701 mSDsluCounter, 2833 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1701 SdHoareTripleChecker+Valid, 4219 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 18:28:07,062 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1701 Valid, 4219 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 18:28:07,063 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1193 states.
[2025-03-03 18:28:07,074 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1189.
[2025-03-03 18:28:07,075 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1189 states, 1188 states have (on average 1.4856902356902357) internal successors, (1765), 1188 states have internal predecessors, (1765), 0 states have call successors, (0), 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 18:28:07,077 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1189 states to 1189 states and 1765 transitions.
[2025-03-03 18:28:07,077 INFO  L78                 Accepts]: Start accepts. Automaton has 1189 states and 1765 transitions. Word has length 100
[2025-03-03 18:28:07,077 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:28:07,077 INFO  L471      AbstractCegarLoop]: Abstraction has 1189 states and 1765 transitions.
[2025-03-03 18:28:07,077 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 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 18:28:07,077 INFO  L276                IsEmpty]: Start isEmpty. Operand 1189 states and 1765 transitions.
[2025-03-03 18:28:07,078 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 101
[2025-03-03 18:28:07,078 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:28:07,078 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 18:28:07,078 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-03 18:28:07,078 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:28:07,079 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:28:07,079 INFO  L85        PathProgramCache]: Analyzing trace with hash 347199033, now seen corresponding path program 1 times
[2025-03-03 18:28:07,079 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:28:07,079 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223684507]
[2025-03-03 18:28:07,079 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:28:07,079 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:28:07,113 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes.
[2025-03-03 18:28:07,152 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements.
[2025-03-03 18:28:07,153 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:28:07,153 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:28:07,774 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 18:28:07,774 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:28:07,774 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223684507]
[2025-03-03 18:28:07,774 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223684507] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:28:07,775 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:28:07,775 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19
[2025-03-03 18:28:07,775 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382021534]
[2025-03-03 18:28:07,775 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:28:07,775 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2025-03-03 18:28:07,775 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:28:07,775 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2025-03-03 18:28:07,776 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342
[2025-03-03 18:28:07,776 INFO  L87              Difference]: Start difference. First operand 1189 states and 1765 transitions. Second operand  has 19 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 19 states have internal predecessors, (100), 0 states have call successors, (0), 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 18:28:09,498 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:28:09,499 INFO  L93              Difference]: Finished difference Result 2252 states and 3352 transitions.
[2025-03-03 18:28:09,499 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2025-03-03 18:28:09,499 INFO  L78                 Accepts]: Start accepts. Automaton has  has 19 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 19 states have internal predecessors, (100), 0 states have call successors, (0), 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 100
[2025-03-03 18:28:09,499 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:28:09,502 INFO  L225             Difference]: With dead ends: 2252
[2025-03-03 18:28:09,502 INFO  L226             Difference]: Without dead ends: 1219
[2025-03-03 18:28:09,503 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380
[2025-03-03 18:28:09,503 INFO  L435           NwaCegarLoop]: 1388 mSDtfsCounter, 1653 mSDsluCounter, 22152 mSDsCounter, 0 mSdLazyCounter, 5425 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1653 SdHoareTripleChecker+Valid, 23540 SdHoareTripleChecker+Invalid, 5426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2025-03-03 18:28:09,503 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1653 Valid, 23540 Invalid, 5426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5425 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2025-03-03 18:28:09,504 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1219 states.
[2025-03-03 18:28:09,512 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1209.
[2025-03-03 18:28:09,513 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1209 states, 1208 states have (on average 1.4884105960264902) internal successors, (1798), 1208 states have internal predecessors, (1798), 0 states have call successors, (0), 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 18:28:09,514 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1798 transitions.
[2025-03-03 18:28:09,514 INFO  L78                 Accepts]: Start accepts. Automaton has 1209 states and 1798 transitions. Word has length 100
[2025-03-03 18:28:09,515 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:28:09,515 INFO  L471      AbstractCegarLoop]: Abstraction has 1209 states and 1798 transitions.
[2025-03-03 18:28:09,515 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 19 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 19 states have internal predecessors, (100), 0 states have call successors, (0), 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 18:28:09,515 INFO  L276                IsEmpty]: Start isEmpty. Operand 1209 states and 1798 transitions.
[2025-03-03 18:28:09,515 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 102
[2025-03-03 18:28:09,515 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:28:09,516 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 18:28:09,516 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-03 18:28:09,516 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:28:09,516 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:28:09,516 INFO  L85        PathProgramCache]: Analyzing trace with hash -1100829718, now seen corresponding path program 1 times
[2025-03-03 18:28:09,516 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:28:09,516 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360684250]
[2025-03-03 18:28:09,516 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:28:09,516 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:28:09,546 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes.
[2025-03-03 18:28:09,612 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements.
[2025-03-03 18:28:09,612 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:28:09,612 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:28:10,043 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 18:28:10,043 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:28:10,043 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360684250]
[2025-03-03 18:28:10,043 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360684250] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:28:10,044 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:28:10,044 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-03-03 18:28:10,044 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015565276]
[2025-03-03 18:28:10,044 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:28:10,044 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-03 18:28:10,045 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:28:10,045 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-03 18:28:10,045 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2025-03-03 18:28:10,045 INFO  L87              Difference]: Start difference. First operand 1209 states and 1798 transitions. Second operand  has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 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 18:28:11,138 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:28:11,138 INFO  L93              Difference]: Finished difference Result 3162 states and 4709 transitions.
[2025-03-03 18:28:11,139 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-03 18:28:11,139 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 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 101
[2025-03-03 18:28:11,139 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:28:11,144 INFO  L225             Difference]: With dead ends: 3162
[2025-03-03 18:28:11,144 INFO  L226             Difference]: Without dead ends: 2082
[2025-03-03 18:28:11,145 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182
[2025-03-03 18:28:11,145 INFO  L435           NwaCegarLoop]: 1378 mSDtfsCounter, 2964 mSDsluCounter, 8261 mSDsCounter, 0 mSdLazyCounter, 2170 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2964 SdHoareTripleChecker+Valid, 9639 SdHoareTripleChecker+Invalid, 2173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-03 18:28:11,146 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2964 Valid, 9639 Invalid, 2173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2170 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-03 18:28:11,147 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2082 states.
[2025-03-03 18:28:11,157 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2082 to 1215.
[2025-03-03 18:28:11,159 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1215 states, 1214 states have (on average 1.486820428336079) internal successors, (1805), 1214 states have internal predecessors, (1805), 0 states have call successors, (0), 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 18:28:11,160 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1805 transitions.
[2025-03-03 18:28:11,160 INFO  L78                 Accepts]: Start accepts. Automaton has 1215 states and 1805 transitions. Word has length 101
[2025-03-03 18:28:11,160 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:28:11,161 INFO  L471      AbstractCegarLoop]: Abstraction has 1215 states and 1805 transitions.
[2025-03-03 18:28:11,161 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 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 18:28:11,161 INFO  L276                IsEmpty]: Start isEmpty. Operand 1215 states and 1805 transitions.
[2025-03-03 18:28:11,161 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2025-03-03 18:28:11,161 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:28:11,161 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 18:28:11,162 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-03 18:28:11,162 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:28:11,162 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:28:11,162 INFO  L85        PathProgramCache]: Analyzing trace with hash 1831163283, now seen corresponding path program 1 times
[2025-03-03 18:28:11,162 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:28:11,162 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688998559]
[2025-03-03 18:28:11,162 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:28:11,162 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:28:11,189 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes.
[2025-03-03 18:28:11,204 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements.
[2025-03-03 18:28:11,205 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:28:11,205 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:28:11,469 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 18:28:11,469 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:28:11,469 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688998559]
[2025-03-03 18:28:11,469 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688998559] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:28:11,469 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:28:11,469 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-03 18:28:11,469 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105213537]
[2025-03-03 18:28:11,469 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:28:11,469 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-03 18:28:11,469 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:28:11,470 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-03 18:28:11,470 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-03-03 18:28:11,470 INFO  L87              Difference]: Start difference. First operand 1215 states and 1805 transitions. Second operand  has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 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 18:28:12,169 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:28:12,169 INFO  L93              Difference]: Finished difference Result 3162 states and 4705 transitions.
[2025-03-03 18:28:12,169 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-03 18:28:12,169 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 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 102
[2025-03-03 18:28:12,170 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:28:12,174 INFO  L225             Difference]: With dead ends: 3162
[2025-03-03 18:28:12,174 INFO  L226             Difference]: Without dead ends: 2082
[2025-03-03 18:28:12,175 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110
[2025-03-03 18:28:12,176 INFO  L435           NwaCegarLoop]: 1381 mSDtfsCounter, 4277 mSDsluCounter, 5519 mSDsCounter, 0 mSdLazyCounter, 1535 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4277 SdHoareTripleChecker+Valid, 6900 SdHoareTripleChecker+Invalid, 1536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 18:28:12,176 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4277 Valid, 6900 Invalid, 1536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1535 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 18:28:12,177 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2082 states.
[2025-03-03 18:28:12,185 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2082 to 1216.
[2025-03-03 18:28:12,186 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1216 states, 1215 states have (on average 1.4839506172839507) internal successors, (1803), 1215 states have internal predecessors, (1803), 0 states have call successors, (0), 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 18:28:12,187 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1803 transitions.
[2025-03-03 18:28:12,187 INFO  L78                 Accepts]: Start accepts. Automaton has 1216 states and 1803 transitions. Word has length 102
[2025-03-03 18:28:12,187 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:28:12,187 INFO  L471      AbstractCegarLoop]: Abstraction has 1216 states and 1803 transitions.
[2025-03-03 18:28:12,187 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 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 18:28:12,188 INFO  L276                IsEmpty]: Start isEmpty. Operand 1216 states and 1803 transitions.
[2025-03-03 18:28:12,188 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-03-03 18:28:12,188 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:28:12,188 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 18:28:12,188 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-03 18:28:12,188 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:28:12,189 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:28:12,189 INFO  L85        PathProgramCache]: Analyzing trace with hash 148546607, now seen corresponding path program 1 times
[2025-03-03 18:28:12,189 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:28:12,189 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925223757]
[2025-03-03 18:28:12,189 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:28:12,189 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:28:12,213 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-03 18:28:12,236 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-03 18:28:12,236 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:28:12,236 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-03 18:28:12,236 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-03-03 18:28:12,249 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-03 18:28:12,267 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-03 18:28:12,268 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:28:12,268 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-03 18:28:12,330 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-03-03 18:28:12,330 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-03-03 18:28:12,330 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-03-03 18:28:12,332 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-03 18:28:12,334 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 18:28:12,397 WARN  L310   BoogieBacktranslator]: Removing null node from list of ATEs: ATE  program state null
[2025-03-03 18:28:12,417 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-03 18:28:12,420 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 06:28:12 BoogieIcfgContainer
[2025-03-03 18:28:12,420 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-03 18:28:12,420 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-03 18:28:12,420 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-03 18:28:12,420 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-03 18:28:12,421 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:27:50" (3/4) ...
[2025-03-03 18:28:12,422 INFO  L149         WitnessPrinter]: No result that supports witness generation found
[2025-03-03 18:28:12,423 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-03 18:28:12,424 INFO  L158              Benchmark]: Toolchain (without parser) took 27672.27ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 102.6MB in the beginning and 730.6MB in the end (delta: -628.0MB). Peak memory consumption was 444.9MB. Max. memory is 16.1GB.
[2025-03-03 18:28:12,424 INFO  L158              Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-03 18:28:12,424 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 649.95ms. Allocated memory is still 142.6MB. Free memory was 102.6MB in the beginning and 71.2MB in the end (delta: 31.4MB). Peak memory consumption was 97.7MB. Max. memory is 16.1GB.
[2025-03-03 18:28:12,424 INFO  L158              Benchmark]: Boogie Procedure Inliner took 474.63ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 71.2MB in the beginning and 297.2MB in the end (delta: -226.0MB). Peak memory consumption was 85.4MB. Max. memory is 16.1GB.
[2025-03-03 18:28:12,424 INFO  L158              Benchmark]: Boogie Preprocessor took 416.14ms. Allocated memory is still 419.4MB. Free memory was 297.2MB in the beginning and 261.1MB in the end (delta: 36.1MB). Peak memory consumption was 46.5MB. Max. memory is 16.1GB.
[2025-03-03 18:28:12,424 INFO  L158              Benchmark]: IcfgBuilder took 3913.32ms. Allocated memory is still 419.4MB. Free memory was 261.1MB in the beginning and 181.8MB in the end (delta: 79.3MB). Peak memory consumption was 206.5MB. Max. memory is 16.1GB.
[2025-03-03 18:28:12,424 INFO  L158              Benchmark]: TraceAbstraction took 22209.64ms. Allocated memory was 419.4MB in the beginning and 1.2GB in the end (delta: 788.5MB). Free memory was 181.8MB in the beginning and 730.7MB in the end (delta: -548.9MB). Peak memory consumption was 235.5MB. Max. memory is 16.1GB.
[2025-03-03 18:28:12,425 INFO  L158              Benchmark]: Witness Printer took 2.62ms. Allocated memory is still 1.2GB. Free memory was 730.7MB in the beginning and 730.6MB in the end (delta: 105.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-03 18:28:12,426 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.14ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 649.95ms. Allocated memory is still 142.6MB. Free memory was 102.6MB in the beginning and 71.2MB in the end (delta: 31.4MB). Peak memory consumption was 97.7MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 474.63ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 71.2MB in the beginning and 297.2MB in the end (delta: -226.0MB). Peak memory consumption was 85.4MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 416.14ms. Allocated memory is still 419.4MB. Free memory was 297.2MB in the beginning and 261.1MB in the end (delta: 36.1MB). Peak memory consumption was 46.5MB. Max. memory is 16.1GB.
 * IcfgBuilder took 3913.32ms. Allocated memory is still 419.4MB. Free memory was 261.1MB in the beginning and 181.8MB in the end (delta: 79.3MB). Peak memory consumption was 206.5MB. Max. memory is 16.1GB.
 * TraceAbstraction took 22209.64ms. Allocated memory was 419.4MB in the beginning and 1.2GB in the end (delta: 788.5MB). Free memory was 181.8MB in the beginning and 730.7MB in the end (delta: -548.9MB). Peak memory consumption was 235.5MB. Max. memory is 16.1GB.
 * Witness Printer took 2.62ms. Allocated memory is still 1.2GB. Free memory was 730.7MB in the beginning and 730.6MB in the end (delta: 105.3kB). 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 409. 
Possible FailurePath: 
[L26]              const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 2);
[L27]              const SORT_1 msb_SORT_1 = (SORT_1)1 << (2 - 1);
[L29]              const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1);
[L30]              const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1);
[L32]              const SORT_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 3);
[L33]              const SORT_6 msb_SORT_6 = (SORT_6)1 << (3 - 1);
[L35]              const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 4);
[L36]              const SORT_12 msb_SORT_12 = (SORT_12)1 << (4 - 1);
[L38]              const SORT_16 mask_SORT_16 = (SORT_16)-1 >> (sizeof(SORT_16) * 8 - 8);
[L39]              const SORT_16 msb_SORT_16 = (SORT_16)1 << (8 - 1);
[L41]              const SORT_21 mask_SORT_21 = (SORT_21)-1 >> (sizeof(SORT_21) * 8 - 7);
[L42]              const SORT_21 msb_SORT_21 = (SORT_21)1 << (7 - 1);
[L44]              const SORT_21 var_22 = 1;
[L45]              const SORT_21 var_26 = 2;
[L46]              const SORT_21 var_29 = 4;
[L47]              const SORT_21 var_33 = 8;
[L48]              const SORT_21 var_37 = 0;
[L49]              const SORT_21 var_46 = 16;
[L50]              const SORT_21 var_49 = 32;
[L51]              const SORT_21 var_52 = 64;
[L52]              const SORT_3 var_57 = 1;
[L53]              const SORT_3 var_61 = 0;
[L54]              const SORT_6 var_146 = 0;
[L56]              SORT_1 input_2;
[L57]              SORT_3 input_4;
[L58]              SORT_3 input_5;
[L59]              SORT_6 input_7;
[L60]              SORT_3 input_8;
[L61]              SORT_3 input_9;
[L62]              SORT_3 input_10;
[L63]              SORT_3 input_11;
[L64]              SORT_12 input_13;
[L65]              SORT_3 input_14;
[L66]              SORT_3 input_15;
[L67]              SORT_16 input_17;
[L68]              SORT_3 input_18;
[L69]              SORT_3 input_19;
[L70]              SORT_3 input_20;
[L71]              SORT_3 input_368;
[L72]              SORT_3 input_390;
[L73]              SORT_3 input_405;
[L74]              SORT_3 input_420;
[L75]              SORT_3 input_435;
[L76]              SORT_3 input_450;
[L77]              SORT_3 input_465;
[L78]              SORT_3 input_480;
[L79]              SORT_3 input_495;
[L80]              SORT_3 input_510;
[L81]              SORT_3 input_525;
[L82]              SORT_3 input_540;
[L83]              SORT_3 input_555;
[L84]              SORT_3 input_570;
[L85]              SORT_3 input_585;
[L86]              SORT_3 input_600;
[L87]              SORT_3 input_616;
[L88]              SORT_3 input_618;
[L89]              SORT_3 input_620;
[L90]              SORT_3 input_622;
[L91]              SORT_3 input_624;
[L92]              SORT_3 input_626;
[L93]              SORT_3 input_628;
[L94]              SORT_3 input_630;
[L95]              SORT_3 input_635;
[L96]              SORT_21 input_676;
[L97]              SORT_21 input_677;
[L98]              SORT_21 input_678;
[L99]              SORT_21 input_679;
[L100]             SORT_21 input_682;
[L101]             SORT_21 input_686;
[L102]             SORT_21 input_690;
[L103]             SORT_21 input_698;
[L104]             SORT_21 input_702;
[L105]             SORT_21 input_704;
[L106]             SORT_21 input_708;
[L107]             SORT_21 input_711;
[L108]             SORT_21 input_715;
[L109]             SORT_21 input_720;
[L110]             SORT_21 input_724;
[L111]             SORT_21 input_729;
[L112]             SORT_21 input_731;
[L113]             SORT_21 input_732;
[L114]             SORT_21 input_734;
[L115]             SORT_21 input_738;
[L116]             SORT_21 input_743;
[L117]             SORT_21 input_750;
[L118]             SORT_21 input_751;
[L119]             SORT_21 input_753;
[L120]             SORT_21 input_757;
[L121]             SORT_21 input_762;
[L122]             SORT_21 input_764;
[L123]             SORT_21 input_765;
[L124]             SORT_21 input_767;
[L125]             SORT_21 input_771;
[L126]             SORT_21 input_776;
[L127]             SORT_21 input_780;
[L128]             SORT_21 input_785;
[L129]             SORT_21 input_787;
[L130]             SORT_21 input_793;
[L131]             SORT_21 input_805;
[L132]             SORT_3 input_810;
[L133]             SORT_3 input_819;
[L134]             SORT_3 input_838;
[L135]             SORT_3 input_845;
[L136]             SORT_3 input_856;
[L137]             SORT_3 input_862;
[L138]             SORT_3 input_868;
[L139]             SORT_3 input_874;
[L140]             SORT_3 input_880;
[L141]             SORT_3 input_886;
[L142]             SORT_3 input_892;
[L143]             SORT_3 input_898;
[L144]             SORT_3 input_904;
[L145]             SORT_3 input_910;
[L146]             SORT_3 input_916;
[L147]             SORT_3 input_922;
[L148]             SORT_3 input_928;
[L150]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_21
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L150]             SORT_21 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_21;
[L151]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_21
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L151]             SORT_21 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_21;
[L152]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L152]             SORT_3 state_62 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L153]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L153]             SORT_3 state_64 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L154]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L154]             SORT_3 state_66 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L155]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L155]             SORT_3 state_70 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L156]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L156]             SORT_3 state_74 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L157]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L157]             SORT_3 state_78 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L158]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L158]             SORT_3 state_94 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L159]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L159]             SORT_3 state_111 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L160]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L160]             SORT_3 state_114 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L161]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L161]             SORT_3 state_116 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L162]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L162]             SORT_3 state_120 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L163]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L163]             SORT_3 state_124 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L164]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L164]             SORT_3 state_129 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L165]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L165]             SORT_3 state_132 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L166]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L166]             SORT_3 state_142 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L167]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L167]             SORT_3 state_149 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L168]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L168]             SORT_3 state_152 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L169]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L169]             SORT_3 state_161 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L170]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L170]             SORT_3 state_166 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L171]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L171]             SORT_3 state_169 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L172]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L172]             SORT_3 state_181 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L173]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L173]             SORT_3 state_191 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L174]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L174]             SORT_3 state_196 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L175]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L175]             SORT_3 state_199 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L176]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L176]             SORT_3 state_208 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L177]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L177]             SORT_3 state_221 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L178]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L178]             SORT_3 state_234 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L180]             SORT_21 init_24_arg_1 = var_22;
[L181]             state_23 = init_24_arg_1
[L182]             SORT_21 init_32_arg_1 = var_22;
[L183]             state_31 = init_32_arg_1
[L184]             SORT_3 init_63_arg_1 = var_61;
[L185]             state_62 = init_63_arg_1
[L186]             SORT_3 init_65_arg_1 = var_61;
[L187]             state_64 = init_65_arg_1
[L188]             SORT_3 init_67_arg_1 = var_61;
[L189]             state_66 = init_67_arg_1
[L190]             SORT_3 init_71_arg_1 = var_61;
[L191]             state_70 = init_71_arg_1
[L192]             SORT_3 init_75_arg_1 = var_61;
[L193]             state_74 = init_75_arg_1
[L194]             SORT_3 init_79_arg_1 = var_61;
[L195]             state_78 = init_79_arg_1
[L196]             SORT_3 init_95_arg_1 = var_61;
[L197]             state_94 = init_95_arg_1
[L198]             SORT_3 init_112_arg_1 = var_61;
[L199]             state_111 = init_112_arg_1
[L200]             SORT_3 init_115_arg_1 = var_61;
[L201]             state_114 = init_115_arg_1
[L202]             SORT_3 init_117_arg_1 = var_61;
[L203]             state_116 = init_117_arg_1
[L204]             SORT_3 init_121_arg_1 = var_61;
[L205]             state_120 = init_121_arg_1
[L206]             SORT_3 init_125_arg_1 = var_61;
[L207]             state_124 = init_125_arg_1
[L208]             SORT_3 init_130_arg_1 = var_61;
[L209]             state_129 = init_130_arg_1
[L210]             SORT_3 init_133_arg_1 = var_61;
[L211]             state_132 = init_133_arg_1
[L212]             SORT_3 init_143_arg_1 = var_61;
[L213]             state_142 = init_143_arg_1
[L214]             SORT_3 init_150_arg_1 = var_61;
[L215]             state_149 = init_150_arg_1
[L216]             SORT_3 init_153_arg_1 = var_61;
[L217]             state_152 = init_153_arg_1
[L218]             SORT_3 init_162_arg_1 = var_61;
[L219]             state_161 = init_162_arg_1
[L220]             SORT_3 init_167_arg_1 = var_61;
[L221]             state_166 = init_167_arg_1
[L222]             SORT_3 init_170_arg_1 = var_61;
[L223]             state_169 = init_170_arg_1
[L224]             SORT_3 init_182_arg_1 = var_61;
[L225]             state_181 = init_182_arg_1
[L226]             SORT_3 init_192_arg_1 = var_61;
[L227]             state_191 = init_192_arg_1
[L228]             SORT_3 init_197_arg_1 = var_61;
[L229]             state_196 = init_197_arg_1
[L230]             SORT_3 init_200_arg_1 = var_61;
[L231]             state_199 = init_200_arg_1
[L232]             SORT_3 init_209_arg_1 = var_61;
[L233]             state_208 = init_209_arg_1
[L234]             SORT_3 init_222_arg_1 = var_61;
[L235]             state_221 = init_222_arg_1
[L236]             SORT_3 init_235_arg_1 = var_61;
[L237]             state_234 = init_235_arg_1
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L240]             input_2 = __VERIFIER_nondet_uchar()
[L241]             input_4 = __VERIFIER_nondet_uchar()
[L242]             input_5 = __VERIFIER_nondet_uchar()
[L243]             input_7 = __VERIFIER_nondet_uchar()
[L244]  EXPR       input_7 & mask_SORT_6
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L244]             input_7 = input_7 & mask_SORT_6
[L245]             input_8 = __VERIFIER_nondet_uchar()
[L246]             input_9 = __VERIFIER_nondet_uchar()
[L247]             input_10 = __VERIFIER_nondet_uchar()
[L248]             input_11 = __VERIFIER_nondet_uchar()
[L249]             input_13 = __VERIFIER_nondet_uchar()
[L250]             input_14 = __VERIFIER_nondet_uchar()
[L251]             input_15 = __VERIFIER_nondet_uchar()
[L252]             input_17 = __VERIFIER_nondet_uchar()
[L253]             input_18 = __VERIFIER_nondet_uchar()
[L254]             input_19 = __VERIFIER_nondet_uchar()
[L255]             input_20 = __VERIFIER_nondet_uchar()
[L256]             input_368 = __VERIFIER_nondet_uchar()
[L257]             input_390 = __VERIFIER_nondet_uchar()
[L258]             input_405 = __VERIFIER_nondet_uchar()
[L259]             input_420 = __VERIFIER_nondet_uchar()
[L260]             input_435 = __VERIFIER_nondet_uchar()
[L261]             input_450 = __VERIFIER_nondet_uchar()
[L262]             input_465 = __VERIFIER_nondet_uchar()
[L263]             input_480 = __VERIFIER_nondet_uchar()
[L264]             input_495 = __VERIFIER_nondet_uchar()
[L265]             input_510 = __VERIFIER_nondet_uchar()
[L266]             input_525 = __VERIFIER_nondet_uchar()
[L267]             input_540 = __VERIFIER_nondet_uchar()
[L268]             input_555 = __VERIFIER_nondet_uchar()
[L269]             input_570 = __VERIFIER_nondet_uchar()
[L270]             input_585 = __VERIFIER_nondet_uchar()
[L271]             input_600 = __VERIFIER_nondet_uchar()
[L272]             input_616 = __VERIFIER_nondet_uchar()
[L273]             input_618 = __VERIFIER_nondet_uchar()
[L274]             input_620 = __VERIFIER_nondet_uchar()
[L275]             input_622 = __VERIFIER_nondet_uchar()
[L276]             input_624 = __VERIFIER_nondet_uchar()
[L277]             input_626 = __VERIFIER_nondet_uchar()
[L278]             input_628 = __VERIFIER_nondet_uchar()
[L279]             input_630 = __VERIFIER_nondet_uchar()
[L280]             input_635 = __VERIFIER_nondet_uchar()
[L281]             input_676 = __VERIFIER_nondet_uchar()
[L282]             input_677 = __VERIFIER_nondet_uchar()
[L283]             input_678 = __VERIFIER_nondet_uchar()
[L284]             input_679 = __VERIFIER_nondet_uchar()
[L285]             input_682 = __VERIFIER_nondet_uchar()
[L286]             input_686 = __VERIFIER_nondet_uchar()
[L287]             input_690 = __VERIFIER_nondet_uchar()
[L288]             input_698 = __VERIFIER_nondet_uchar()
[L289]             input_702 = __VERIFIER_nondet_uchar()
[L290]             input_704 = __VERIFIER_nondet_uchar()
[L291]             input_708 = __VERIFIER_nondet_uchar()
[L292]             input_711 = __VERIFIER_nondet_uchar()
[L293]             input_715 = __VERIFIER_nondet_uchar()
[L294]             input_720 = __VERIFIER_nondet_uchar()
[L295]             input_724 = __VERIFIER_nondet_uchar()
[L296]             input_729 = __VERIFIER_nondet_uchar()
[L297]             input_731 = __VERIFIER_nondet_uchar()
[L298]             input_732 = __VERIFIER_nondet_uchar()
[L299]             input_734 = __VERIFIER_nondet_uchar()
[L300]             input_738 = __VERIFIER_nondet_uchar()
[L301]             input_743 = __VERIFIER_nondet_uchar()
[L302]             input_750 = __VERIFIER_nondet_uchar()
[L303]             input_751 = __VERIFIER_nondet_uchar()
[L304]             input_753 = __VERIFIER_nondet_uchar()
[L305]             input_757 = __VERIFIER_nondet_uchar()
[L306]             input_762 = __VERIFIER_nondet_uchar()
[L307]             input_764 = __VERIFIER_nondet_uchar()
[L308]             input_765 = __VERIFIER_nondet_uchar()
[L309]             input_767 = __VERIFIER_nondet_uchar()
[L310]             input_771 = __VERIFIER_nondet_uchar()
[L311]             input_776 = __VERIFIER_nondet_uchar()
[L312]             input_780 = __VERIFIER_nondet_uchar()
[L313]             input_785 = __VERIFIER_nondet_uchar()
[L314]             input_787 = __VERIFIER_nondet_uchar()
[L315]             input_793 = __VERIFIER_nondet_uchar()
[L316]             input_805 = __VERIFIER_nondet_uchar()
[L317]             input_810 = __VERIFIER_nondet_uchar()
[L318]             input_819 = __VERIFIER_nondet_uchar()
[L319]             input_838 = __VERIFIER_nondet_uchar()
[L320]             input_845 = __VERIFIER_nondet_uchar()
[L321]             input_856 = __VERIFIER_nondet_uchar()
[L322]             input_862 = __VERIFIER_nondet_uchar()
[L323]             input_868 = __VERIFIER_nondet_uchar()
[L324]             input_874 = __VERIFIER_nondet_uchar()
[L325]             input_880 = __VERIFIER_nondet_uchar()
[L326]             input_886 = __VERIFIER_nondet_uchar()
[L327]             input_892 = __VERIFIER_nondet_uchar()
[L328]             input_898 = __VERIFIER_nondet_uchar()
[L329]             input_904 = __VERIFIER_nondet_uchar()
[L330]             input_910 = __VERIFIER_nondet_uchar()
[L331]             input_916 = __VERIFIER_nondet_uchar()
[L332]             input_922 = __VERIFIER_nondet_uchar()
[L333]             input_928 = __VERIFIER_nondet_uchar()
[L336]             SORT_21 var_25_arg_0 = state_23;
[L337]             SORT_21 var_25_arg_1 = var_22;
[L338]             SORT_3 var_25 = var_25_arg_0 == var_25_arg_1;
[L339]             SORT_21 var_27_arg_0 = state_23;
[L340]             SORT_21 var_27_arg_1 = var_26;
[L341]             SORT_3 var_27 = var_27_arg_0 == var_27_arg_1;
[L342]             SORT_3 var_28_arg_0 = var_25;
[L343]             SORT_3 var_28_arg_1 = var_27;
        VAL        [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28_arg_0=1, var_28_arg_1=0, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L344]  EXPR       var_28_arg_0 | var_28_arg_1
        VAL        [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L344]             SORT_3 var_28 = var_28_arg_0 | var_28_arg_1;
[L345]             SORT_21 var_30_arg_0 = state_23;
[L346]             SORT_21 var_30_arg_1 = var_29;
[L347]             SORT_3 var_30 = var_30_arg_0 == var_30_arg_1;
[L348]             SORT_21 var_34_arg_0 = state_31;
[L349]             SORT_21 var_34_arg_1 = var_33;
[L350]             SORT_3 var_34 = var_34_arg_0 == var_34_arg_1;
[L351]             SORT_21 var_35_arg_0 = state_31;
[L352]             SORT_21 var_35_arg_1 = var_22;
[L353]             SORT_3 var_35 = var_35_arg_0 == var_35_arg_1;
[L354]             SORT_3 var_36_arg_0 = var_34;
[L355]             SORT_3 var_36_arg_1 = var_35;
        VAL        [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28=1, var_29=4, var_30=0, var_33=8, var_36_arg_0=0, var_36_arg_1=1, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L356]  EXPR       var_36_arg_0 | var_36_arg_1
        VAL        [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28=1, var_29=4, var_30=0, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L356]             SORT_3 var_36 = var_36_arg_0 | var_36_arg_1;
[L357]             SORT_21 var_38_arg_0 = state_31;
[L358]             SORT_21 var_38_arg_1 = var_37;
[L359]             SORT_3 var_38 = var_38_arg_0 == var_38_arg_1;
[L360]             SORT_3 var_39_arg_0 = var_36;
[L361]             SORT_3 var_39_arg_1 = var_38;
        VAL        [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28=1, var_29=4, var_30=0, var_33=8, var_37=0, var_39_arg_0=1, var_39_arg_1=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L362]  EXPR       var_39_arg_0 | var_39_arg_1
        VAL        [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28=1, var_29=4, var_30=0, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L362]             SORT_3 var_39 = var_39_arg_0 | var_39_arg_1;
[L363]             SORT_21 var_40_arg_0 = state_31;
[L364]             SORT_21 var_40_arg_1 = var_29;
[L365]             SORT_3 var_40 = var_40_arg_0 == var_40_arg_1;
[L366]             SORT_3 var_41_arg_0 = var_39;
[L367]             SORT_3 var_41_arg_1 = var_40;
        VAL        [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28=1, var_29=4, var_30=0, var_33=8, var_37=0, var_41_arg_0=1, var_41_arg_1=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L368]  EXPR       var_41_arg_0 | var_41_arg_1
        VAL        [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28=1, var_29=4, var_30=0, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L368]             SORT_3 var_41 = var_41_arg_0 | var_41_arg_1;
[L369]             SORT_3 var_42_arg_0 = var_30;
[L370]             SORT_3 var_42_arg_1 = var_41;
        VAL        [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28=1, var_29=4, var_33=8, var_37=0, var_42_arg_0=0, var_42_arg_1=1, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L371]  EXPR       var_42_arg_0 & var_42_arg_1
        VAL        [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_28=1, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L371]             SORT_3 var_42 = var_42_arg_0 & var_42_arg_1;
[L372]             SORT_3 var_43_arg_0 = var_28;
[L373]             SORT_3 var_43_arg_1 = var_42;
        VAL        [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_43_arg_0=1, var_43_arg_1=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L374]  EXPR       var_43_arg_0 | var_43_arg_1
        VAL        [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L374]             SORT_3 var_43 = var_43_arg_0 | var_43_arg_1;
[L375]             SORT_21 var_44_arg_0 = state_23;
[L376]             SORT_21 var_44_arg_1 = var_33;
[L377]             SORT_3 var_44 = var_44_arg_0 == var_44_arg_1;
[L378]             SORT_3 var_45_arg_0 = var_43;
[L379]             SORT_3 var_45_arg_1 = var_44;
        VAL        [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_45_arg_0=1, var_45_arg_1=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L380]  EXPR       var_45_arg_0 | var_45_arg_1
        VAL        [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L380]             SORT_3 var_45 = var_45_arg_0 | var_45_arg_1;
[L381]             SORT_21 var_47_arg_0 = state_23;
[L382]             SORT_21 var_47_arg_1 = var_46;
[L383]             SORT_3 var_47 = var_47_arg_0 == var_47_arg_1;
[L384]             SORT_3 var_48_arg_0 = var_45;
[L385]             SORT_3 var_48_arg_1 = var_47;
        VAL        [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_48_arg_0=1, var_48_arg_1=0, var_49=32, var_52=64, var_57=1, var_61=0]
[L386]  EXPR       var_48_arg_0 | var_48_arg_1
        VAL        [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L386]             SORT_3 var_48 = var_48_arg_0 | var_48_arg_1;
[L387]             SORT_21 var_50_arg_0 = state_23;
[L388]             SORT_21 var_50_arg_1 = var_49;
[L389]             SORT_3 var_50 = var_50_arg_0 == var_50_arg_1;
[L390]             SORT_3 var_51_arg_0 = var_48;
[L391]             SORT_3 var_51_arg_1 = var_50;
        VAL        [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_51_arg_0=1, var_51_arg_1=0, var_52=64, var_57=1, var_61=0]
[L392]  EXPR       var_51_arg_0 | var_51_arg_1
        VAL        [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L392]             SORT_3 var_51 = var_51_arg_0 | var_51_arg_1;
[L393]             SORT_21 var_53_arg_0 = state_23;
[L394]             SORT_21 var_53_arg_1 = var_52;
[L395]             SORT_3 var_53 = var_53_arg_0 == var_53_arg_1;
[L396]             SORT_3 var_54_arg_0 = var_51;
[L397]             SORT_3 var_54_arg_1 = var_53;
        VAL        [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_54_arg_0=1, var_54_arg_1=0, var_57=1, var_61=0]
[L398]  EXPR       var_54_arg_0 | var_54_arg_1
        VAL        [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_23=1, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L398]             SORT_3 var_54 = var_54_arg_0 | var_54_arg_1;
[L399]             SORT_21 var_55_arg_0 = state_23;
[L400]             SORT_21 var_55_arg_1 = var_37;
[L401]             SORT_3 var_55 = var_55_arg_0 == var_55_arg_1;
[L402]             SORT_3 var_56_arg_0 = var_54;
[L403]             SORT_3 var_56_arg_1 = var_55;
        VAL        [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_56_arg_0=1, var_56_arg_1=0, var_57=1, var_61=0]
[L404]  EXPR       var_56_arg_0 | var_56_arg_1
        VAL        [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L404]             SORT_3 var_56 = var_56_arg_0 | var_56_arg_1;
[L405]             SORT_3 var_58_arg_0 = var_56;
[L406]             SORT_3 var_58 = ~var_58_arg_0;
[L407]             SORT_3 var_59_arg_0 = var_57;
[L408]             SORT_3 var_59_arg_1 = var_58;
        VAL        [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_59_arg_0=1, var_59_arg_1=-2, var_61=0]
[L409]  EXPR       var_59_arg_0 & var_59_arg_1
        VAL        [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L409]             SORT_3 var_59 = var_59_arg_0 & var_59_arg_1;
[L410]  EXPR       var_59 & mask_SORT_3
        VAL        [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_111=0, state_114=0, state_116=0, state_120=0, state_124=0, state_129=0, state_132=0, state_142=0, state_149=0, state_152=0, state_161=0, state_166=0, state_169=0, state_181=0, state_191=0, state_196=0, state_199=0, state_208=0, state_221=0, state_234=0, state_31=1, state_62=0, state_64=0, state_66=0, state_70=0, state_74=0, state_78=0, state_94=0, var_146=0, var_22=1, var_26=2, var_29=4, var_33=8, var_37=0, var_46=16, var_49=32, var_52=64, var_57=1, var_61=0]
[L410]             var_59 = var_59 & mask_SORT_3
[L411]             SORT_3 bad_60_arg_0 = var_59;
[L412]  CALL       __VERIFIER_assert(!(bad_60_arg_0))
[L21]   COND TRUE  !(cond)
[L21]              reach_error()

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 1130 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.1s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 27895 SdHoareTripleChecker+Valid, 11.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27895 mSDsluCounter, 115538 SdHoareTripleChecker+Invalid, 9.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 91926 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25595 IncrementalHoareTripleChecker+Invalid, 25607 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 23612 mSDtfsCounter, 25595 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 200 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1216occurred in iteration=17, InterpolantAutomatonStates: 130, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 1902 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 1750 NumberOfCodeBlocks, 1750 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1630 ConstructedInterpolants, 0 QuantifiedInterpolants, 8350 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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 18:28:12,446 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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.vcegar_QF_BV_pj_icu_icctl_p2.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 7eccc5bbdbaf49f286af1eaa6e037aac70bd43bbdd029365a1ddd6424cc3712f
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-03 18:28:14,340 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-03 18:28:14,410 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf
[2025-03-03 18:28:14,416 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-03 18:28:14,417 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-03 18:28:14,444 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-03 18:28:14,445 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-03 18:28:14,445 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-03 18:28:14,446 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-03 18:28:14,446 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-03 18:28:14,447 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-03 18:28:14,447 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-03 18:28:14,447 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-03 18:28:14,447 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-03 18:28:14,447 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-03 18:28:14,447 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-03 18:28:14,448 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-03 18:28:14,448 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-03 18:28:14,448 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-03 18:28:14,448 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-03 18:28:14,448 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-03 18:28:14,448 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2025-03-03 18:28:14,448 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2025-03-03 18:28:14,448 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2025-03-03 18:28:14,448 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-03 18:28:14,448 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-03 18:28:14,449 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-03 18:28:14,449 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-03 18:28:14,449 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-03 18:28:14,449 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-03 18:28:14,449 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-03 18:28:14,449 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 18:28:14,449 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-03 18:28:14,450 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-03 18:28:14,450 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-03 18:28:14,450 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-03 18:28:14,450 INFO  L153        SettingsManager]:  * Trace refinement strategy=FOX
[2025-03-03 18:28:14,450 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt 
[2025-03-03 18:28:14,450 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-03 18:28:14,450 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-03 18:28:14,450 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-03 18:28:14,450 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-03 18:28:14,450 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 -> 7eccc5bbdbaf49f286af1eaa6e037aac70bd43bbdd029365a1ddd6424cc3712f
[2025-03-03 18:28:14,670 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 18:28:14,679 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 18:28:14,681 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 18:28:14,682 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 18:28:14,682 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 18:28:14,683 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p2.c
[2025-03-03 18:28:15,832 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1612063c5/b82b232b8c274da384667cae84e02eb0/FLAG5996a8161
[2025-03-03 18:28:16,156 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 18:28:16,157 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p2.c
[2025-03-03 18:28:16,188 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1612063c5/b82b232b8c274da384667cae84e02eb0/FLAG5996a8161
[2025-03-03 18:28:16,202 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1612063c5/b82b232b8c274da384667cae84e02eb0
[2025-03-03 18:28:16,204 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 18:28:16,206 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 18:28:16,208 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 18:28:16,208 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 18:28:16,211 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 18:28:16,212 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:28:16" (1/1) ...
[2025-03-03 18:28:16,214 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d75a94b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:28:16, skipping insertion in model container
[2025-03-03 18:28:16,214 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:28:16" (1/1) ...
[2025-03-03 18:28:16,264 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 18:28:16,389 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.vcegar_QF_BV_pj_icu_icctl_p2.c[1268,1281]
[2025-03-03 18:28:16,595 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 18:28:16,603 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 18:28:16,611 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.vcegar_QF_BV_pj_icu_icctl_p2.c[1268,1281]
[2025-03-03 18:28:16,727 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 18:28:16,738 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 18:28:16,738 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:28:16 WrapperNode
[2025-03-03 18:28:16,739 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 18:28:16,739 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 18:28:16,740 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 18:28:16,740 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 18:28:16,745 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:28:16" (1/1) ...
[2025-03-03 18:28:16,783 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:28:16" (1/1) ...
[2025-03-03 18:28:16,877 INFO  L138                Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2640
[2025-03-03 18:28:16,877 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 18:28:16,877 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 18:28:16,877 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 18:28:16,878 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 18:28:16,883 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:28:16" (1/1) ...
[2025-03-03 18:28:16,883 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:28:16" (1/1) ...
[2025-03-03 18:28:16,896 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:28:16" (1/1) ...
[2025-03-03 18:28:16,938 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 18:28:16,938 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:28:16" (1/1) ...
[2025-03-03 18:28:16,938 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:28:16" (1/1) ...
[2025-03-03 18:28:16,990 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:28:16" (1/1) ...
[2025-03-03 18:28:16,994 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:28:16" (1/1) ...
[2025-03-03 18:28:16,998 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:28:16" (1/1) ...
[2025-03-03 18:28:17,003 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:28:16" (1/1) ...
[2025-03-03 18:28:17,018 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 18:28:17,019 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 18:28:17,019 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 18:28:17,019 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 18:28:17,020 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:28:16" (1/1) ...
[2025-03-03 18:28:17,024 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 18:28:17,033 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 18:28:17,044 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 18:28:17,047 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 18:28:17,064 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 18:28:17,065 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2025-03-03 18:28:17,065 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 18:28:17,065 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 18:28:17,384 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 18:28:17,385 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 18:28:19,361 INFO  L?                        ?]: Removed 183 outVars from TransFormulas that were not future-live.
[2025-03-03 18:28:19,361 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 18:28:19,367 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 18:28:19,368 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 18:28:19,368 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:28:19 BoogieIcfgContainer
[2025-03-03 18:28:19,368 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 18:28:19,370 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 18:28:19,370 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 18:28:19,373 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 18:28:19,373 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:28:16" (1/3) ...
[2025-03-03 18:28:19,374 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a52f5d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:28:19, skipping insertion in model container
[2025-03-03 18:28:19,374 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:28:16" (2/3) ...
[2025-03-03 18:28:19,375 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a52f5d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:28:19, skipping insertion in model container
[2025-03-03 18:28:19,375 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:28:19" (3/3) ...
[2025-03-03 18:28:19,376 INFO  L128   eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p2.c
[2025-03-03 18:28:19,386 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 18:28:19,387 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p2.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 18:28:19,419 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 18:28:19,427 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;@74e6cb4e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 18:28:19,428 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 18:28:19,431 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 18:28:19,434 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2025-03-03 18:28:19,434 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:28:19,435 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2025-03-03 18:28:19,435 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:28:19,439 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:28:19,439 INFO  L85        PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times
[2025-03-03 18:28:19,447 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 18:28:19,448 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [238725398]
[2025-03-03 18:28:19,448 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:28:19,448 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:28:19,449 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 18:28:19,451 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 18:28:19,453 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 18:28:19,854 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes.
[2025-03-03 18:28:19,880 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements.
[2025-03-03 18:28:19,881 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:28:19,881 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:28:19,887 INFO  L256         TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 28 conjuncts are in the unsatisfiable core
[2025-03-03 18:28:19,898 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 18:28:20,008 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 18:28:20,009 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 18:28:20,009 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-03 18:28:20,009 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238725398]
[2025-03-03 18:28:20,010 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [238725398] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:28:20,010 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:28:20,010 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 18:28:20,012 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958533305]
[2025-03-03 18:28:20,012 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:28:20,014 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 18:28:20,015 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-03 18:28:20,027 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 18:28:20,028 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 18:28:20,030 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 18:28:20,101 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:28:20,101 INFO  L93              Difference]: Finished difference Result 17 states and 22 transitions.
[2025-03-03 18:28:20,105 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 18:28:20,106 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 18:28:20,106 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:28:20,110 INFO  L225             Difference]: With dead ends: 17
[2025-03-03 18:28:20,110 INFO  L226             Difference]: Without dead ends: 9
[2025-03-03 18:28:20,112 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 18:28:20,114 INFO  L435           NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time
[2025-03-03 18:28:20,116 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.1s Time]
[2025-03-03 18:28:20,126 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9 states.
[2025-03-03 18:28:20,133 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9.
[2025-03-03 18:28:20,133 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 18:28:20,136 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions.
[2025-03-03 18:28:20,137 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5
[2025-03-03 18:28:20,138 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:28:20,138 INFO  L471      AbstractCegarLoop]: Abstraction has 9 states and 9 transitions.
[2025-03-03 18:28:20,138 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 18:28:20,138 INFO  L276                IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions.
[2025-03-03 18:28:20,138 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2025-03-03 18:28:20,139 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:28:20,139 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1]
[2025-03-03 18:28:20,147 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 18:28:20,339 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 18:28:20,340 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:28:20,340 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:28:20,341 INFO  L85        PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times
[2025-03-03 18:28:20,342 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 18:28:20,344 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1047892937]
[2025-03-03 18:28:20,344 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:28:20,345 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:28:20,345 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 18:28:20,347 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 18:28:20,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 18:28:20,871 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes.
[2025-03-03 18:28:20,984 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements.
[2025-03-03 18:28:20,985 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:28:20,985 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:28:20,996 INFO  L256         TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 32 conjuncts are in the unsatisfiable core
[2025-03-03 18:28:21,010 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 18:28:21,140 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:28:21,140 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 18:28:25,554 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 18:28:25,554 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-03 18:28:25,554 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047892937]
[2025-03-03 18:28:25,554 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047892937] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 18:28:25,555 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-03-03 18:28:25,555 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10
[2025-03-03 18:28:25,555 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48288981]
[2025-03-03 18:28:25,555 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-03-03 18:28:25,557 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-03 18:28:25,557 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-03 18:28:25,557 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-03 18:28:25,557 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=64, Unknown=1, NotChecked=0, Total=90
[2025-03-03 18:28:25,558 INFO  L87              Difference]: Start difference. First operand 9 states and 9 transitions. Second operand  has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 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 18:28:25,720 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:28:25,720 INFO  L93              Difference]: Finished difference Result 14 states and 14 transitions.
[2025-03-03 18:28:25,720 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-03 18:28:25,721 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 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 8
[2025-03-03 18:28:25,721 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:28:25,721 INFO  L225             Difference]: With dead ends: 14
[2025-03-03 18:28:25,721 INFO  L226             Difference]: Without dead ends: 12
[2025-03-03 18:28:25,722 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=40, Invalid=91, Unknown=1, NotChecked=0, Total=132
[2025-03-03 18:28:25,722 INFO  L435           NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 18:28:25,722 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 18:28:25,723 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12 states.
[2025-03-03 18:28:25,723 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12.
[2025-03-03 18:28:25,723 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 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 18:28:25,724 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions.
[2025-03-03 18:28:25,724 INFO  L78                 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8
[2025-03-03 18:28:25,724 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:28:25,724 INFO  L471      AbstractCegarLoop]: Abstraction has 12 states and 12 transitions.
[2025-03-03 18:28:25,724 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 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 18:28:25,724 INFO  L276                IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions.
[2025-03-03 18:28:25,724 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2025-03-03 18:28:25,724 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:28:25,724 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1]
[2025-03-03 18:28:25,732 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 18:28:25,925 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 18:28:25,925 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:28:25,925 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:28:25,925 INFO  L85        PathProgramCache]: Analyzing trace with hash -1791040441, now seen corresponding path program 2 times
[2025-03-03 18:28:25,927 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 18:28:25,927 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [634631560]
[2025-03-03 18:28:25,927 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-03-03 18:28:25,927 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:28:25,927 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 18:28:25,931 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 18:28:25,932 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-03-03 18:28:26,475 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes.
[2025-03-03 18:28:26,680 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements.
[2025-03-03 18:28:26,680 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-03-03 18:28:26,680 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:28:26,694 INFO  L256         TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 73 conjuncts are in the unsatisfiable core
[2025-03-03 18:28:26,712 INFO  L279         TraceCheckSpWp]: Computing forward predicates...