./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-52.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
Using default analysis
Version e2fb8bed
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-52.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 65e290fb975399bc2cc283273eaab9fa300db5fe57e6fb279b59522887532a83
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 12:39:41,226 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 12:39:41,280 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-08 12:39:41,283 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 12:39:41,287 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 12:39:41,304 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 12:39:41,305 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 12:39:41,305 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 12:39:41,305 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 12:39:41,305 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 12:39:41,306 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 12:39:41,306 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 12:39:41,307 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 12:39:41,307 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 12:39:41,307 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 12:39:41,307 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 12:39:41,307 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 12:39:41,307 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-08 12:39:41,307 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-08 12:39:41,308 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-08 12:39:41,308 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 12:39:41,308 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 12:39:41,308 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 12:39:41,308 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 12:39:41,308 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-08 12:39:41,308 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 12:39:41,308 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 12:39:41,308 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 12:39:41,308 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 12:39:41,308 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 12:39:41,309 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 12:39:41,309 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 12:39:41,309 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 12:39:41,309 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 12:39:41,309 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 12:39:41,309 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 12:39:41,309 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 12:39:41,309 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-08 12:39:41,309 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-08 12:39:41,309 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 12:39:41,309 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 12:39:41,310 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 12:39:41,310 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 12:39:41,310 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 65e290fb975399bc2cc283273eaab9fa300db5fe57e6fb279b59522887532a83
[2025-03-08 12:39:41,505 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 12:39:41,512 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 12:39:41,514 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 12:39:41,515 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 12:39:41,515 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 12:39:41,516 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-52.i
[2025-03-08 12:39:42,689 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf62fb158/13a8ba173f8c4ad0b2842d55ed453177/FLAG73ce509e9
[2025-03-08 12:39:42,953 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 12:39:42,955 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-52.i
[2025-03-08 12:39:42,963 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf62fb158/13a8ba173f8c4ad0b2842d55ed453177/FLAG73ce509e9
[2025-03-08 12:39:42,983 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf62fb158/13a8ba173f8c4ad0b2842d55ed453177
[2025-03-08 12:39:42,985 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 12:39:42,986 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 12:39:42,987 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 12:39:42,987 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 12:39:42,991 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 12:39:42,992 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:39:42" (1/1) ...
[2025-03-08 12:39:42,994 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2427776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:39:42, skipping insertion in model container
[2025-03-08 12:39:42,994 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:39:42" (1/1) ...
[2025-03-08 12:39:43,008 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 12:39:43,116 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-52.i[919,932]
[2025-03-08 12:39:43,182 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 12:39:43,195 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 12:39:43,205 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-52.i[919,932]
[2025-03-08 12:39:43,234 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 12:39:43,245 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 12:39:43,246 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:39:43 WrapperNode
[2025-03-08 12:39:43,246 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 12:39:43,247 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 12:39:43,247 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 12:39:43,247 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 12:39:43,251 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:39:43" (1/1) ...
[2025-03-08 12:39:43,258 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:39:43" (1/1) ...
[2025-03-08 12:39:43,285 INFO  L138                Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 203
[2025-03-08 12:39:43,285 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 12:39:43,286 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 12:39:43,286 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 12:39:43,286 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 12:39:43,294 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:39:43" (1/1) ...
[2025-03-08 12:39:43,294 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:39:43" (1/1) ...
[2025-03-08 12:39:43,296 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:39:43" (1/1) ...
[2025-03-08 12:39:43,312 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-08 12:39:43,313 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:39:43" (1/1) ...
[2025-03-08 12:39:43,313 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:39:43" (1/1) ...
[2025-03-08 12:39:43,318 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:39:43" (1/1) ...
[2025-03-08 12:39:43,319 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:39:43" (1/1) ...
[2025-03-08 12:39:43,320 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:39:43" (1/1) ...
[2025-03-08 12:39:43,321 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:39:43" (1/1) ...
[2025-03-08 12:39:43,323 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 12:39:43,324 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 12:39:43,324 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 12:39:43,324 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 12:39:43,325 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:39:43" (1/1) ...
[2025-03-08 12:39:43,329 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 12:39:43,339 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 12:39:43,351 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-08 12:39:43,355 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-08 12:39:43,373 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 12:39:43,373 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-08 12:39:43,374 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-08 12:39:43,374 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-08 12:39:43,374 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 12:39:43,374 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 12:39:43,435 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 12:39:43,437 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 12:39:43,761 INFO  L?                        ?]: Removed 22 outVars from TransFormulas that were not future-live.
[2025-03-08 12:39:43,761 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 12:39:43,773 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 12:39:43,773 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 12:39:43,774 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:39:43 BoogieIcfgContainer
[2025-03-08 12:39:43,774 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 12:39:43,775 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 12:39:43,775 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 12:39:43,779 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 12:39:43,779 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:39:42" (1/3) ...
[2025-03-08 12:39:43,780 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bec9161 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:39:43, skipping insertion in model container
[2025-03-08 12:39:43,781 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:39:43" (2/3) ...
[2025-03-08 12:39:43,781 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bec9161 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:39:43, skipping insertion in model container
[2025-03-08 12:39:43,781 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:39:43" (3/3) ...
[2025-03-08 12:39:43,782 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-52.i
[2025-03-08 12:39:43,793 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 12:39:43,796 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-52.i that has 2 procedures, 86 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 12:39:43,842 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 12:39:43,853 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;@4149cdc7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 12:39:43,854 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 12:39:43,860 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 86 states, 61 states have (on average 1.459016393442623) internal successors, (89), 62 states have internal predecessors, (89), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22)
[2025-03-08 12:39:43,868 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 153
[2025-03-08 12:39:43,869 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 12:39:43,869 INFO  L218           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:39:43,870 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 12:39:43,874 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 12:39:43,874 INFO  L85        PathProgramCache]: Analyzing trace with hash -628904948, now seen corresponding path program 1 times
[2025-03-08 12:39:43,879 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 12:39:43,879 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555160729]
[2025-03-08 12:39:43,880 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:39:43,880 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 12:39:43,956 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes.
[2025-03-08 12:39:43,983 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements.
[2025-03-08 12:39:43,983 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:39:43,983 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:39:44,159 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked.
[2025-03-08 12:39:44,159 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 12:39:44,160 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555160729]
[2025-03-08 12:39:44,160 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555160729] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 12:39:44,160 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934234057]
[2025-03-08 12:39:44,160 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:39:44,160 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 12:39:44,160 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 12:39:44,164 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-08 12:39:44,165 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-08 12:39:44,233 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes.
[2025-03-08 12:39:44,292 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements.
[2025-03-08 12:39:44,293 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:39:44,293 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:39:44,295 INFO  L256         TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-08 12:39:44,306 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 12:39:44,333 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked.
[2025-03-08 12:39:44,334 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 12:39:44,335 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [934234057] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 12:39:44,335 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 12:39:44,335 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-03-08 12:39:44,337 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394223177]
[2025-03-08 12:39:44,337 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 12:39:44,340 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-08 12:39:44,341 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 12:39:44,355 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-08 12:39:44,355 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 12:39:44,357 INFO  L87              Difference]: Start difference. First operand  has 86 states, 61 states have (on average 1.459016393442623) internal successors, (89), 62 states have internal predecessors, (89), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand  has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22)
[2025-03-08 12:39:44,383 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 12:39:44,384 INFO  L93              Difference]: Finished difference Result 166 states and 283 transitions.
[2025-03-08 12:39:44,385 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-08 12:39:44,386 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 152
[2025-03-08 12:39:44,386 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 12:39:44,390 INFO  L225             Difference]: With dead ends: 166
[2025-03-08 12:39:44,390 INFO  L226             Difference]: Without dead ends: 83
[2025-03-08 12:39:44,393 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 12:39:44,395 INFO  L435           NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 12:39:44,395 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 12:39:44,404 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 83 states.
[2025-03-08 12:39:44,423 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83.
[2025-03-08 12:39:44,424 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 83 states, 59 states have (on average 1.423728813559322) internal successors, (84), 59 states have internal predecessors, (84), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22)
[2025-03-08 12:39:44,429 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 128 transitions.
[2025-03-08 12:39:44,432 INFO  L78                 Accepts]: Start accepts. Automaton has 83 states and 128 transitions. Word has length 152
[2025-03-08 12:39:44,433 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 12:39:44,433 INFO  L471      AbstractCegarLoop]: Abstraction has 83 states and 128 transitions.
[2025-03-08 12:39:44,433 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22)
[2025-03-08 12:39:44,433 INFO  L276                IsEmpty]: Start isEmpty. Operand 83 states and 128 transitions.
[2025-03-08 12:39:44,436 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 153
[2025-03-08 12:39:44,437 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 12:39:44,437 INFO  L218           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:39:44,444 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-08 12:39:44,637 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0
[2025-03-08 12:39:44,638 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 12:39:44,638 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 12:39:44,638 INFO  L85        PathProgramCache]: Analyzing trace with hash 1238997616, now seen corresponding path program 1 times
[2025-03-08 12:39:44,638 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 12:39:44,638 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850428795]
[2025-03-08 12:39:44,638 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:39:44,638 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 12:39:44,677 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes.
[2025-03-08 12:39:44,726 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements.
[2025-03-08 12:39:44,726 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:39:44,726 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:39:45,158 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked.
[2025-03-08 12:39:45,158 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 12:39:45,158 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850428795]
[2025-03-08 12:39:45,158 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850428795] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 12:39:45,159 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 12:39:45,160 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 12:39:45,160 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338495021]
[2025-03-08 12:39:45,160 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 12:39:45,161 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 12:39:45,161 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 12:39:45,161 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 12:39:45,162 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 12:39:45,162 INFO  L87              Difference]: Start difference. First operand 83 states and 128 transitions. Second operand  has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 12:39:45,415 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 12:39:45,416 INFO  L93              Difference]: Finished difference Result 264 states and 413 transitions.
[2025-03-08 12:39:45,416 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 12:39:45,416 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 152
[2025-03-08 12:39:45,417 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 12:39:45,418 INFO  L225             Difference]: With dead ends: 264
[2025-03-08 12:39:45,419 INFO  L226             Difference]: Without dead ends: 184
[2025-03-08 12:39:45,419 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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-08 12:39:45,420 INFO  L435           NwaCegarLoop]: 201 mSDtfsCounter, 188 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 12:39:45,420 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 547 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 12:39:45,421 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 184 states.
[2025-03-08 12:39:45,430 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 95.
[2025-03-08 12:39:45,433 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 95 states, 71 states have (on average 1.4507042253521127) internal successors, (103), 71 states have internal predecessors, (103), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22)
[2025-03-08 12:39:45,434 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 147 transitions.
[2025-03-08 12:39:45,435 INFO  L78                 Accepts]: Start accepts. Automaton has 95 states and 147 transitions. Word has length 152
[2025-03-08 12:39:45,437 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 12:39:45,437 INFO  L471      AbstractCegarLoop]: Abstraction has 95 states and 147 transitions.
[2025-03-08 12:39:45,438 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 12:39:45,438 INFO  L276                IsEmpty]: Start isEmpty. Operand 95 states and 147 transitions.
[2025-03-08 12:39:45,440 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 153
[2025-03-08 12:39:45,440 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 12:39:45,440 INFO  L218           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:39:45,440 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-08 12:39:45,441 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 12:39:45,442 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 12:39:45,443 INFO  L85        PathProgramCache]: Analyzing trace with hash -114312081, now seen corresponding path program 1 times
[2025-03-08 12:39:45,443 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 12:39:45,443 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689081837]
[2025-03-08 12:39:45,443 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:39:45,443 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 12:39:45,462 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes.
[2025-03-08 12:39:45,496 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements.
[2025-03-08 12:39:45,497 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:39:45,497 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:39:45,679 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked.
[2025-03-08 12:39:45,679 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 12:39:45,679 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689081837]
[2025-03-08 12:39:45,679 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689081837] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 12:39:45,679 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 12:39:45,679 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 12:39:45,679 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594440721]
[2025-03-08 12:39:45,679 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 12:39:45,680 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 12:39:45,680 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 12:39:45,680 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 12:39:45,680 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 12:39:45,680 INFO  L87              Difference]: Start difference. First operand 95 states and 147 transitions. Second operand  has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 12:39:45,739 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 12:39:45,739 INFO  L93              Difference]: Finished difference Result 273 states and 429 transitions.
[2025-03-08 12:39:45,739 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 12:39:45,739 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 152
[2025-03-08 12:39:45,741 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 12:39:45,742 INFO  L225             Difference]: With dead ends: 273
[2025-03-08 12:39:45,744 INFO  L226             Difference]: Without dead ends: 181
[2025-03-08 12:39:45,744 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 12:39:45,745 INFO  L435           NwaCegarLoop]: 117 mSDtfsCounter, 71 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 12:39:45,746 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 227 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 12:39:45,747 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 181 states.
[2025-03-08 12:39:45,768 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 162.
[2025-03-08 12:39:45,771 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 162 states, 115 states have (on average 1.4086956521739131) internal successors, (162), 115 states have internal predecessors, (162), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44)
[2025-03-08 12:39:45,773 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 250 transitions.
[2025-03-08 12:39:45,774 INFO  L78                 Accepts]: Start accepts. Automaton has 162 states and 250 transitions. Word has length 152
[2025-03-08 12:39:45,775 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 12:39:45,775 INFO  L471      AbstractCegarLoop]: Abstraction has 162 states and 250 transitions.
[2025-03-08 12:39:45,775 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 12:39:45,775 INFO  L276                IsEmpty]: Start isEmpty. Operand 162 states and 250 transitions.
[2025-03-08 12:39:45,776 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 154
[2025-03-08 12:39:45,776 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 12:39:45,777 INFO  L218           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:39:45,777 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-08 12:39:45,777 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 12:39:45,778 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 12:39:45,778 INFO  L85        PathProgramCache]: Analyzing trace with hash -1565061813, now seen corresponding path program 1 times
[2025-03-08 12:39:45,778 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 12:39:45,778 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675493113]
[2025-03-08 12:39:45,778 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:39:45,778 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 12:39:45,790 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes.
[2025-03-08 12:39:45,817 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements.
[2025-03-08 12:39:45,817 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:39:45,817 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:39:45,996 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked.
[2025-03-08 12:39:45,997 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 12:39:45,997 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675493113]
[2025-03-08 12:39:45,997 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675493113] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 12:39:45,997 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 12:39:45,997 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 12:39:45,997 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723796434]
[2025-03-08 12:39:45,997 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 12:39:45,997 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 12:39:45,997 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 12:39:45,998 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 12:39:45,998 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 12:39:45,998 INFO  L87              Difference]: Start difference. First operand 162 states and 250 transitions. Second operand  has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 12:39:46,062 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 12:39:46,063 INFO  L93              Difference]: Finished difference Result 360 states and 562 transitions.
[2025-03-08 12:39:46,064 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 12:39:46,064 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 153
[2025-03-08 12:39:46,064 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 12:39:46,066 INFO  L225             Difference]: With dead ends: 360
[2025-03-08 12:39:46,066 INFO  L226             Difference]: Without dead ends: 254
[2025-03-08 12:39:46,067 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 12:39:46,067 INFO  L435           NwaCegarLoop]: 117 mSDtfsCounter, 84 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 12:39:46,067 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 229 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 12:39:46,070 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 254 states.
[2025-03-08 12:39:46,101 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252.
[2025-03-08 12:39:46,102 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 252 states, 182 states have (on average 1.4120879120879122) internal successors, (257), 182 states have internal predecessors, (257), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66)
[2025-03-08 12:39:46,103 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 389 transitions.
[2025-03-08 12:39:46,105 INFO  L78                 Accepts]: Start accepts. Automaton has 252 states and 389 transitions. Word has length 153
[2025-03-08 12:39:46,105 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 12:39:46,105 INFO  L471      AbstractCegarLoop]: Abstraction has 252 states and 389 transitions.
[2025-03-08 12:39:46,105 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 12:39:46,106 INFO  L276                IsEmpty]: Start isEmpty. Operand 252 states and 389 transitions.
[2025-03-08 12:39:46,108 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 155
[2025-03-08 12:39:46,108 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 12:39:46,108 INFO  L218           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:39:46,108 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-08 12:39:46,108 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 12:39:46,109 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 12:39:46,109 INFO  L85        PathProgramCache]: Analyzing trace with hash -725124908, now seen corresponding path program 1 times
[2025-03-08 12:39:46,110 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 12:39:46,110 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314789530]
[2025-03-08 12:39:46,110 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:39:46,110 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 12:39:46,125 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes.
[2025-03-08 12:39:46,160 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements.
[2025-03-08 12:39:46,160 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:39:46,160 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:39:46,677 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked.
[2025-03-08 12:39:46,678 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 12:39:46,678 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314789530]
[2025-03-08 12:39:46,678 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314789530] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 12:39:46,678 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 12:39:46,678 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 12:39:46,678 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613883405]
[2025-03-08 12:39:46,678 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 12:39:46,679 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 12:39:46,679 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 12:39:46,679 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 12:39:46,680 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2025-03-08 12:39:46,680 INFO  L87              Difference]: Start difference. First operand 252 states and 389 transitions. Second operand  has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 12:39:46,830 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 12:39:46,831 INFO  L93              Difference]: Finished difference Result 525 states and 799 transitions.
[2025-03-08 12:39:46,832 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 12:39:46,833 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 154
[2025-03-08 12:39:46,833 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 12:39:46,836 INFO  L225             Difference]: With dead ends: 525
[2025-03-08 12:39:46,836 INFO  L226             Difference]: Without dead ends: 343
[2025-03-08 12:39:46,837 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2025-03-08 12:39:46,838 INFO  L435           NwaCegarLoop]: 114 mSDtfsCounter, 113 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 12:39:46,839 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 283 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 12:39:46,839 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 343 states.
[2025-03-08 12:39:46,873 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 291.
[2025-03-08 12:39:46,874 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 291 states, 218 states have (on average 1.3807339449541285) internal successors, (301), 218 states have internal predecessors, (301), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66)
[2025-03-08 12:39:46,875 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 433 transitions.
[2025-03-08 12:39:46,876 INFO  L78                 Accepts]: Start accepts. Automaton has 291 states and 433 transitions. Word has length 154
[2025-03-08 12:39:46,876 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 12:39:46,876 INFO  L471      AbstractCegarLoop]: Abstraction has 291 states and 433 transitions.
[2025-03-08 12:39:46,876 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 12:39:46,877 INFO  L276                IsEmpty]: Start isEmpty. Operand 291 states and 433 transitions.
[2025-03-08 12:39:46,877 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 156
[2025-03-08 12:39:46,878 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 12:39:46,878 INFO  L218           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:39:46,878 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-08 12:39:46,878 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 12:39:46,878 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 12:39:46,878 INFO  L85        PathProgramCache]: Analyzing trace with hash -1012039729, now seen corresponding path program 1 times
[2025-03-08 12:39:46,879 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 12:39:46,879 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178668611]
[2025-03-08 12:39:46,879 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:39:46,879 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 12:39:46,889 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes.
[2025-03-08 12:39:46,955 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements.
[2025-03-08 12:39:46,956 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:39:46,956 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:39:47,411 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked.
[2025-03-08 12:39:47,411 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 12:39:47,411 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178668611]
[2025-03-08 12:39:47,411 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178668611] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 12:39:47,412 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 12:39:47,412 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 12:39:47,412 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568286473]
[2025-03-08 12:39:47,412 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 12:39:47,412 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 12:39:47,413 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 12:39:47,413 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 12:39:47,413 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 12:39:47,414 INFO  L87              Difference]: Start difference. First operand 291 states and 433 transitions. Second operand  has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 12:39:47,496 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 12:39:47,496 INFO  L93              Difference]: Finished difference Result 566 states and 847 transitions.
[2025-03-08 12:39:47,497 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 12:39:47,497 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 155
[2025-03-08 12:39:47,497 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 12:39:47,499 INFO  L225             Difference]: With dead ends: 566
[2025-03-08 12:39:47,501 INFO  L226             Difference]: Without dead ends: 331
[2025-03-08 12:39:47,502 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 12:39:47,502 INFO  L435           NwaCegarLoop]: 122 mSDtfsCounter, 67 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 12:39:47,502 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 329 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 12:39:47,503 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 331 states.
[2025-03-08 12:39:47,532 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 291.
[2025-03-08 12:39:47,532 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 291 states, 218 states have (on average 1.371559633027523) internal successors, (299), 218 states have internal predecessors, (299), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66)
[2025-03-08 12:39:47,534 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 431 transitions.
[2025-03-08 12:39:47,534 INFO  L78                 Accepts]: Start accepts. Automaton has 291 states and 431 transitions. Word has length 155
[2025-03-08 12:39:47,534 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 12:39:47,534 INFO  L471      AbstractCegarLoop]: Abstraction has 291 states and 431 transitions.
[2025-03-08 12:39:47,535 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 12:39:47,535 INFO  L276                IsEmpty]: Start isEmpty. Operand 291 states and 431 transitions.
[2025-03-08 12:39:47,536 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 158
[2025-03-08 12:39:47,536 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 12:39:47,536 INFO  L218           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:39:47,536 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-08 12:39:47,536 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 12:39:47,536 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 12:39:47,536 INFO  L85        PathProgramCache]: Analyzing trace with hash -606319381, now seen corresponding path program 1 times
[2025-03-08 12:39:47,536 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 12:39:47,537 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436710708]
[2025-03-08 12:39:47,537 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:39:47,537 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 12:39:47,548 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes.
[2025-03-08 12:39:47,609 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements.
[2025-03-08 12:39:47,610 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:39:47,610 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:39:47,916 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked.
[2025-03-08 12:39:47,916 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 12:39:47,916 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436710708]
[2025-03-08 12:39:47,916 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436710708] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 12:39:47,916 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 12:39:47,917 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 12:39:47,917 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667013002]
[2025-03-08 12:39:47,917 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 12:39:47,917 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 12:39:47,917 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 12:39:47,917 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 12:39:47,918 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 12:39:47,918 INFO  L87              Difference]: Start difference. First operand 291 states and 431 transitions. Second operand  has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22)
[2025-03-08 12:39:48,199 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 12:39:48,200 INFO  L93              Difference]: Finished difference Result 607 states and 908 transitions.
[2025-03-08 12:39:48,200 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 12:39:48,200 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 157
[2025-03-08 12:39:48,200 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 12:39:48,202 INFO  L225             Difference]: With dead ends: 607
[2025-03-08 12:39:48,202 INFO  L226             Difference]: Without dead ends: 391
[2025-03-08 12:39:48,203 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2025-03-08 12:39:48,203 INFO  L435           NwaCegarLoop]: 103 mSDtfsCounter, 228 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 12:39:48,203 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 423 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 12:39:48,204 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 391 states.
[2025-03-08 12:39:48,223 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 335.
[2025-03-08 12:39:48,223 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 335 states, 262 states have (on average 1.3854961832061068) internal successors, (363), 262 states have internal predecessors, (363), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66)
[2025-03-08 12:39:48,225 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 495 transitions.
[2025-03-08 12:39:48,225 INFO  L78                 Accepts]: Start accepts. Automaton has 335 states and 495 transitions. Word has length 157
[2025-03-08 12:39:48,225 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 12:39:48,226 INFO  L471      AbstractCegarLoop]: Abstraction has 335 states and 495 transitions.
[2025-03-08 12:39:48,226 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22)
[2025-03-08 12:39:48,226 INFO  L276                IsEmpty]: Start isEmpty. Operand 335 states and 495 transitions.
[2025-03-08 12:39:48,227 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 158
[2025-03-08 12:39:48,227 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 12:39:48,227 INFO  L218           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:39:48,227 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-08 12:39:48,227 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 12:39:48,227 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 12:39:48,227 INFO  L85        PathProgramCache]: Analyzing trace with hash 1590879948, now seen corresponding path program 1 times
[2025-03-08 12:39:48,228 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 12:39:48,228 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505707098]
[2025-03-08 12:39:48,228 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:39:48,228 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 12:39:48,237 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes.
[2025-03-08 12:39:48,247 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements.
[2025-03-08 12:39:48,247 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:39:48,247 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:39:48,284 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked.
[2025-03-08 12:39:48,284 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 12:39:48,284 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505707098]
[2025-03-08 12:39:48,284 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505707098] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 12:39:48,284 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 12:39:48,284 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 12:39:48,285 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960096870]
[2025-03-08 12:39:48,285 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 12:39:48,285 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 12:39:48,285 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 12:39:48,285 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 12:39:48,285 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 12:39:48,286 INFO  L87              Difference]: Start difference. First operand 335 states and 495 transitions. Second operand  has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 12:39:48,344 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 12:39:48,344 INFO  L93              Difference]: Finished difference Result 711 states and 1054 transitions.
[2025-03-08 12:39:48,346 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 12:39:48,347 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157
[2025-03-08 12:39:48,349 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 12:39:48,351 INFO  L225             Difference]: With dead ends: 711
[2025-03-08 12:39:48,351 INFO  L226             Difference]: Without dead ends: 476
[2025-03-08 12:39:48,354 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 12:39:48,354 INFO  L435           NwaCegarLoop]: 201 mSDtfsCounter, 98 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 12:39:48,355 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 310 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 12:39:48,355 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 476 states.
[2025-03-08 12:39:48,399 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 346.
[2025-03-08 12:39:48,400 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 346 states, 273 states have (on average 1.3772893772893773) internal successors, (376), 273 states have internal predecessors, (376), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66)
[2025-03-08 12:39:48,402 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 508 transitions.
[2025-03-08 12:39:48,402 INFO  L78                 Accepts]: Start accepts. Automaton has 346 states and 508 transitions. Word has length 157
[2025-03-08 12:39:48,406 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 12:39:48,406 INFO  L471      AbstractCegarLoop]: Abstraction has 346 states and 508 transitions.
[2025-03-08 12:39:48,406 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 12:39:48,406 INFO  L276                IsEmpty]: Start isEmpty. Operand 346 states and 508 transitions.
[2025-03-08 12:39:48,407 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 158
[2025-03-08 12:39:48,407 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 12:39:48,407 INFO  L218           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 12:39:48,407 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-08 12:39:48,407 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 12:39:48,407 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 12:39:48,407 INFO  L85        PathProgramCache]: Analyzing trace with hash 303597765, now seen corresponding path program 1 times
[2025-03-08 12:39:48,408 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 12:39:48,408 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214203389]
[2025-03-08 12:39:48,408 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:39:48,408 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 12:39:48,428 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes.
[2025-03-08 12:39:48,547 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements.
[2025-03-08 12:39:48,547 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:39:48,547 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat