./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem18_label43.c --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version 798a7b37
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem18_label43.c -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 e577ac4fec98ce8190b7e2567f5dad5b2e39d7f9e4c346cfe2efdd450e4d5c55
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-03 11:07:00,601 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-03 11:07:00,652 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-03 11:07:00,655 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-03 11:07:00,655 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-03 11:07:00,678 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-03 11:07:00,679 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-03 11:07:00,679 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-03 11:07:00,679 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-03 11:07:00,680 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-03 11:07:00,680 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-03 11:07:00,680 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-03 11:07:00,680 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-03 11:07:00,680 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-03 11:07:00,680 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-03 11:07:00,681 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-03 11:07:00,681 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-03 11:07:00,681 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-03 11:07:00,681 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-03 11:07:00,681 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-03 11:07:00,681 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-03 11:07:00,681 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-03 11:07:00,681 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-03 11:07:00,681 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-03 11:07:00,681 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-03 11:07:00,681 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-03 11:07:00,681 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-03 11:07:00,681 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-03 11:07:00,681 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-03 11:07:00,681 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-03 11:07:00,681 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-03 11:07:00,681 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-03 11:07:00,681 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 11:07:00,681 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-03 11:07:00,681 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-03 11:07:00,682 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-03 11:07:00,682 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-03 11:07:00,682 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-03 11:07:00,682 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-03 11:07:00,682 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-03 11:07:00,682 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-03 11:07:00,683 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-03 11:07:00,683 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-03 11:07:00,683 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 -> e577ac4fec98ce8190b7e2567f5dad5b2e39d7f9e4c346cfe2efdd450e4d5c55
[2025-03-03 11:07:00,922 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 11:07:00,930 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 11:07:00,933 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 11:07:00,933 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 11:07:00,934 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 11:07:00,935 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem18_label43.c
[2025-03-03 11:07:02,050 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36eee8a05/f75d82de3d4c4c589a75875e2145cad2/FLAGb276361a0
[2025-03-03 11:07:02,484 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 11:07:02,484 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label43.c
[2025-03-03 11:07:02,508 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36eee8a05/f75d82de3d4c4c589a75875e2145cad2/FLAGb276361a0
[2025-03-03 11:07:02,629 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36eee8a05/f75d82de3d4c4c589a75875e2145cad2
[2025-03-03 11:07:02,631 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 11:07:02,632 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 11:07:02,634 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 11:07:02,634 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 11:07:02,637 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 11:07:02,638 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:07:02" (1/1) ...
[2025-03-03 11:07:02,640 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75854446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:07:02, skipping insertion in model container
[2025-03-03 11:07:02,640 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:07:02" (1/1) ...
[2025-03-03 11:07:02,702 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 11:07:02,875 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/eca-rers2012/Problem18_label43.c[6843,6856]
[2025-03-03 11:07:03,256 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 11:07:03,264 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 11:07:03,282 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/eca-rers2012/Problem18_label43.c[6843,6856]
[2025-03-03 11:07:03,481 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 11:07:03,496 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 11:07:03,497 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:07:03 WrapperNode
[2025-03-03 11:07:03,497 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 11:07:03,498 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 11:07:03,498 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 11:07:03,499 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 11:07:03,503 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:07:03" (1/1) ...
[2025-03-03 11:07:03,543 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:07:03" (1/1) ...
[2025-03-03 11:07:03,680 INFO  L138                Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4132
[2025-03-03 11:07:03,680 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 11:07:03,681 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 11:07:03,681 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 11:07:03,681 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 11:07:03,687 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:07:03" (1/1) ...
[2025-03-03 11:07:03,687 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:07:03" (1/1) ...
[2025-03-03 11:07:03,712 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:07:03" (1/1) ...
[2025-03-03 11:07:03,771 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-03 11:07:03,771 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:07:03" (1/1) ...
[2025-03-03 11:07:03,771 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:07:03" (1/1) ...
[2025-03-03 11:07:03,857 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:07:03" (1/1) ...
[2025-03-03 11:07:03,866 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:07:03" (1/1) ...
[2025-03-03 11:07:03,877 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:07:03" (1/1) ...
[2025-03-03 11:07:03,886 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:07:03" (1/1) ...
[2025-03-03 11:07:03,903 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 11:07:03,904 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 11:07:03,905 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 11:07:03,905 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 11:07:03,906 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:07:03" (1/1) ...
[2025-03-03 11:07:03,909 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 11:07:03,919 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 11:07:03,931 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-03 11:07:03,936 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-03 11:07:03,951 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 11:07:03,951 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 11:07:03,951 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 11:07:03,951 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 11:07:04,000 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 11:07:04,003 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 11:07:06,631 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L1647: havoc calculate_output_#t~ret8#1;
[2025-03-03 11:07:06,632 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L3060: havoc calculate_output2_#t~ret9#1;
[2025-03-03 11:07:06,715 INFO  L?                        ?]: Removed 639 outVars from TransFormulas that were not future-live.
[2025-03-03 11:07:06,715 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 11:07:06,746 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 11:07:06,746 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 11:07:06,746 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:07:06 BoogieIcfgContainer
[2025-03-03 11:07:06,747 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 11:07:06,748 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 11:07:06,748 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 11:07:06,752 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 11:07:06,752 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:07:02" (1/3) ...
[2025-03-03 11:07:06,753 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44e06629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:07:06, skipping insertion in model container
[2025-03-03 11:07:06,753 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:07:03" (2/3) ...
[2025-03-03 11:07:06,753 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44e06629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:07:06, skipping insertion in model container
[2025-03-03 11:07:06,753 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:07:06" (3/3) ...
[2025-03-03 11:07:06,754 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem18_label43.c
[2025-03-03 11:07:06,765 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 11:07:06,766 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem18_label43.c that has 1 procedures, 757 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 11:07:06,823 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 11:07:06,832 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;@3362655f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 11:07:06,832 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 11:07:06,840 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 757 states, 755 states have (on average 1.9112582781456953) internal successors, (1443), 756 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:06,845 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2025-03-03 11:07:06,846 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:07:06,847 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 11:07:06,847 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:07:06,851 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:07:06,852 INFO  L85        PathProgramCache]: Analyzing trace with hash 464142244, now seen corresponding path program 1 times
[2025-03-03 11:07:06,857 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:07:06,857 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436806330]
[2025-03-03 11:07:06,857 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:07:06,858 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:07:06,914 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes.
[2025-03-03 11:07:06,946 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements.
[2025-03-03 11:07:06,948 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:07:06,952 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:07:07,219 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 11:07:07,219 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:07:07,219 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436806330]
[2025-03-03 11:07:07,220 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436806330] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:07:07,220 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:07:07,220 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 11:07:07,221 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698706664]
[2025-03-03 11:07:07,222 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:07:07,224 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 11:07:07,224 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:07:07,236 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 11:07:07,237 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 11:07:07,240 INFO  L87              Difference]: Start difference. First operand  has 757 states, 755 states have (on average 1.9112582781456953) internal successors, (1443), 756 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:11,007 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:07:11,008 INFO  L93              Difference]: Finished difference Result 2900 states and 5644 transitions.
[2025-03-03 11:07:11,009 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 11:07:11,010 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66
[2025-03-03 11:07:11,010 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:07:11,023 INFO  L225             Difference]: With dead ends: 2900
[2025-03-03 11:07:11,023 INFO  L226             Difference]: Without dead ends: 2074
[2025-03-03 11:07:11,030 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 11:07:11,032 INFO  L435           NwaCegarLoop]: 142 mSDtfsCounter, 2140 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 3368 mSolverCounterSat, 1796 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2140 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 5164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1796 IncrementalHoareTripleChecker+Valid, 3368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time
[2025-03-03 11:07:11,033 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2140 Valid, 160 Invalid, 5164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1796 Valid, 3368 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time]
[2025-03-03 11:07:11,049 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2074 states.
[2025-03-03 11:07:11,114 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 2074.
[2025-03-03 11:07:11,117 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2074 states, 2073 states have (on average 1.5561987457790643) internal successors, (3226), 2073 states have internal predecessors, (3226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:11,125 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 3226 transitions.
[2025-03-03 11:07:11,127 INFO  L78                 Accepts]: Start accepts. Automaton has 2074 states and 3226 transitions. Word has length 66
[2025-03-03 11:07:11,127 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:07:11,127 INFO  L471      AbstractCegarLoop]: Abstraction has 2074 states and 3226 transitions.
[2025-03-03 11:07:11,127 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:11,127 INFO  L276                IsEmpty]: Start isEmpty. Operand 2074 states and 3226 transitions.
[2025-03-03 11:07:11,131 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 244
[2025-03-03 11:07:11,131 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:07:11,131 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 11:07:11,132 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-03 11:07:11,132 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:07:11,132 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:07:11,132 INFO  L85        PathProgramCache]: Analyzing trace with hash -427672936, now seen corresponding path program 1 times
[2025-03-03 11:07:11,133 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:07:11,133 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371700249]
[2025-03-03 11:07:11,133 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:07:11,133 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:07:11,159 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes.
[2025-03-03 11:07:11,182 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements.
[2025-03-03 11:07:11,185 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:07:11,186 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:07:11,729 INFO  L134       CoverageAnalysis]: Checked inductivity of 210 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked.
[2025-03-03 11:07:11,730 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:07:11,730 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371700249]
[2025-03-03 11:07:11,730 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371700249] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:07:11,731 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:07:11,731 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 11:07:11,731 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259382605]
[2025-03-03 11:07:11,731 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:07:11,733 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 11:07:11,733 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:07:11,733 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 11:07:11,734 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 11:07:11,734 INFO  L87              Difference]: Start difference. First operand 2074 states and 3226 transitions. Second operand  has 4 states, 4 states have (on average 45.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:14,979 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:07:14,979 INFO  L93              Difference]: Finished difference Result 6908 states and 10880 transitions.
[2025-03-03 11:07:14,979 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 11:07:14,979 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 45.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 243
[2025-03-03 11:07:14,980 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:07:14,993 INFO  L225             Difference]: With dead ends: 6908
[2025-03-03 11:07:14,994 INFO  L226             Difference]: Without dead ends: 4836
[2025-03-03 11:07:14,996 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 11:07:14,997 INFO  L435           NwaCegarLoop]: 631 mSDtfsCounter, 1925 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 4380 mSolverCounterSat, 615 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1925 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 4995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 615 IncrementalHoareTripleChecker+Valid, 4380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time
[2025-03-03 11:07:14,997 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1925 Valid, 649 Invalid, 4995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [615 Valid, 4380 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time]
[2025-03-03 11:07:15,000 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4836 states.
[2025-03-03 11:07:15,044 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4836 to 4144.
[2025-03-03 11:07:15,048 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4144 states, 4143 states have (on average 1.3379193820902728) internal successors, (5543), 4143 states have internal predecessors, (5543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:15,053 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 5543 transitions.
[2025-03-03 11:07:15,054 INFO  L78                 Accepts]: Start accepts. Automaton has 4144 states and 5543 transitions. Word has length 243
[2025-03-03 11:07:15,054 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:07:15,054 INFO  L471      AbstractCegarLoop]: Abstraction has 4144 states and 5543 transitions.
[2025-03-03 11:07:15,054 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 45.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:15,054 INFO  L276                IsEmpty]: Start isEmpty. Operand 4144 states and 5543 transitions.
[2025-03-03 11:07:15,058 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 333
[2025-03-03 11:07:15,058 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:07:15,058 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 11:07:15,058 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 11:07:15,058 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:07:15,059 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:07:15,059 INFO  L85        PathProgramCache]: Analyzing trace with hash 697882621, now seen corresponding path program 1 times
[2025-03-03 11:07:15,059 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:07:15,059 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934704530]
[2025-03-03 11:07:15,059 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:07:15,059 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:07:15,083 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes.
[2025-03-03 11:07:15,105 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements.
[2025-03-03 11:07:15,105 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:07:15,105 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:07:15,429 INFO  L134       CoverageAnalysis]: Checked inductivity of 210 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2025-03-03 11:07:15,430 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:07:15,430 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934704530]
[2025-03-03 11:07:15,430 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934704530] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:07:15,430 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:07:15,430 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 11:07:15,430 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540453074]
[2025-03-03 11:07:15,430 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:07:15,430 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 11:07:15,430 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:07:15,432 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 11:07:15,433 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 11:07:15,433 INFO  L87              Difference]: Start difference. First operand 4144 states and 5543 transitions. Second operand  has 4 states, 4 states have (on average 80.0) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:17,572 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:07:17,573 INFO  L93              Difference]: Finished difference Result 10409 states and 13837 transitions.
[2025-03-03 11:07:17,573 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 11:07:17,574 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 80.0) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 332
[2025-03-03 11:07:17,574 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:07:17,590 INFO  L225             Difference]: With dead ends: 10409
[2025-03-03 11:07:17,592 INFO  L226             Difference]: Without dead ends: 6214
[2025-03-03 11:07:17,596 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 11:07:17,599 INFO  L435           NwaCegarLoop]: 624 mSDtfsCounter, 513 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 3037 mSolverCounterSat, 688 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 3725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 688 IncrementalHoareTripleChecker+Valid, 3037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2025-03-03 11:07:17,599 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 637 Invalid, 3725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [688 Valid, 3037 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2025-03-03 11:07:17,604 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6214 states.
[2025-03-03 11:07:17,657 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6214 to 5524.
[2025-03-03 11:07:17,662 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5524 states, 5523 states have (on average 1.1922868006518197) internal successors, (6585), 5523 states have internal predecessors, (6585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:17,669 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5524 states to 5524 states and 6585 transitions.
[2025-03-03 11:07:17,669 INFO  L78                 Accepts]: Start accepts. Automaton has 5524 states and 6585 transitions. Word has length 332
[2025-03-03 11:07:17,670 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:07:17,670 INFO  L471      AbstractCegarLoop]: Abstraction has 5524 states and 6585 transitions.
[2025-03-03 11:07:17,671 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 80.0) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:17,671 INFO  L276                IsEmpty]: Start isEmpty. Operand 5524 states and 6585 transitions.
[2025-03-03 11:07:17,684 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 965
[2025-03-03 11:07:17,684 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:07:17,685 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 11:07:17,686 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-03 11:07:17,686 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:07:17,687 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:07:17,687 INFO  L85        PathProgramCache]: Analyzing trace with hash 1855582883, now seen corresponding path program 1 times
[2025-03-03 11:07:17,689 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:07:17,689 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501985594]
[2025-03-03 11:07:17,689 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:07:17,689 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:07:17,745 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 964 statements into 1 equivalence classes.
[2025-03-03 11:07:17,790 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 964 of 964 statements.
[2025-03-03 11:07:17,790 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:07:17,790 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:07:18,391 INFO  L134       CoverageAnalysis]: Checked inductivity of 656 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked.
[2025-03-03 11:07:18,392 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:07:18,392 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501985594]
[2025-03-03 11:07:18,392 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501985594] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:07:18,392 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:07:18,392 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 11:07:18,392 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890027324]
[2025-03-03 11:07:18,392 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:07:18,393 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:07:18,393 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:07:18,394 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:07:18,394 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:07:18,394 INFO  L87              Difference]: Start difference. First operand 5524 states and 6585 transitions. Second operand  has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 2 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:19,866 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:07:19,866 INFO  L93              Difference]: Finished difference Result 13116 states and 16145 transitions.
[2025-03-03 11:07:19,866 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:07:19,866 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 2 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 964
[2025-03-03 11:07:19,867 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:07:19,882 INFO  L225             Difference]: With dead ends: 13116
[2025-03-03 11:07:19,882 INFO  L226             Difference]: Without dead ends: 7594
[2025-03-03 11:07:19,886 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-03 11:07:19,886 INFO  L435           NwaCegarLoop]: 383 mSDtfsCounter, 227 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1667 mSolverCounterSat, 602 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 2269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 602 IncrementalHoareTripleChecker+Valid, 1667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-03-03 11:07:19,887 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 388 Invalid, 2269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [602 Valid, 1667 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-03-03 11:07:19,891 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7594 states.
[2025-03-03 11:07:19,947 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7594 to 6904.
[2025-03-03 11:07:19,954 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6904 states, 6903 states have (on average 1.1754309720411416) internal successors, (8114), 6903 states have internal predecessors, (8114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:19,962 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6904 states to 6904 states and 8114 transitions.
[2025-03-03 11:07:19,962 INFO  L78                 Accepts]: Start accepts. Automaton has 6904 states and 8114 transitions. Word has length 964
[2025-03-03 11:07:19,964 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:07:19,966 INFO  L471      AbstractCegarLoop]: Abstraction has 6904 states and 8114 transitions.
[2025-03-03 11:07:19,966 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 2 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:19,966 INFO  L276                IsEmpty]: Start isEmpty. Operand 6904 states and 8114 transitions.
[2025-03-03 11:07:19,987 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1033
[2025-03-03 11:07:19,987 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:07:19,988 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 11:07:19,989 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-03 11:07:19,989 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:07:19,989 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:07:19,990 INFO  L85        PathProgramCache]: Analyzing trace with hash -1828581806, now seen corresponding path program 1 times
[2025-03-03 11:07:19,990 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:07:19,990 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142118146]
[2025-03-03 11:07:19,990 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:07:19,990 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:07:20,056 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1032 statements into 1 equivalence classes.
[2025-03-03 11:07:20,096 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1032 of 1032 statements.
[2025-03-03 11:07:20,097 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:07:20,097 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:07:20,620 INFO  L134       CoverageAnalysis]: Checked inductivity of 923 backedges. 426 proven. 0 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked.
[2025-03-03 11:07:20,620 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:07:20,620 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142118146]
[2025-03-03 11:07:20,620 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142118146] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:07:20,621 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:07:20,621 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 11:07:20,621 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875672309]
[2025-03-03 11:07:20,621 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:07:20,622 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:07:20,622 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:07:20,623 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:07:20,623 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:07:20,624 INFO  L87              Difference]: Start difference. First operand 6904 states and 8114 transitions. Second operand  has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 2 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:22,187 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:07:22,188 INFO  L93              Difference]: Finished difference Result 15876 states and 18743 transitions.
[2025-03-03 11:07:22,188 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:07:22,188 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 2 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1032
[2025-03-03 11:07:22,189 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:07:22,212 INFO  L225             Difference]: With dead ends: 15876
[2025-03-03 11:07:22,212 INFO  L226             Difference]: Without dead ends: 8974
[2025-03-03 11:07:22,219 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-03 11:07:22,219 INFO  L435           NwaCegarLoop]: 72 mSDtfsCounter, 249 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 673 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 2464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 673 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-03-03 11:07:22,219 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 77 Invalid, 2464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [673 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-03-03 11:07:22,225 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8974 states.
[2025-03-03 11:07:22,321 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8974 to 8974.
[2025-03-03 11:07:22,336 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8974 states, 8973 states have (on average 1.1619302351498941) internal successors, (10426), 8973 states have internal predecessors, (10426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:22,345 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8974 states to 8974 states and 10426 transitions.
[2025-03-03 11:07:22,345 INFO  L78                 Accepts]: Start accepts. Automaton has 8974 states and 10426 transitions. Word has length 1032
[2025-03-03 11:07:22,346 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:07:22,347 INFO  L471      AbstractCegarLoop]: Abstraction has 8974 states and 10426 transitions.
[2025-03-03 11:07:22,347 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 2 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:22,347 INFO  L276                IsEmpty]: Start isEmpty. Operand 8974 states and 10426 transitions.
[2025-03-03 11:07:22,355 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1083
[2025-03-03 11:07:22,355 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:07:22,355 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 11:07:22,356 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-03 11:07:22,356 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:07:22,357 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:07:22,357 INFO  L85        PathProgramCache]: Analyzing trace with hash -1415488875, now seen corresponding path program 1 times
[2025-03-03 11:07:22,357 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:07:22,357 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116686508]
[2025-03-03 11:07:22,357 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:07:22,357 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:07:22,416 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1082 statements into 1 equivalence classes.
[2025-03-03 11:07:22,453 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1082 of 1082 statements.
[2025-03-03 11:07:22,453 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:07:22,453 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:07:23,192 INFO  L134       CoverageAnalysis]: Checked inductivity of 1039 backedges. 678 proven. 0 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked.
[2025-03-03 11:07:23,192 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:07:23,192 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116686508]
[2025-03-03 11:07:23,192 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116686508] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:07:23,192 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:07:23,192 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 11:07:23,192 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121044055]
[2025-03-03 11:07:23,193 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:07:23,193 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:07:23,193 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:07:23,194 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:07:23,194 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:07:23,195 INFO  L87              Difference]: Start difference. First operand 8974 states and 10426 transitions. Second operand  has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:24,637 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:07:24,638 INFO  L93              Difference]: Finished difference Result 24156 states and 28457 transitions.
[2025-03-03 11:07:24,638 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:07:24,638 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1082
[2025-03-03 11:07:24,639 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:07:24,666 INFO  L225             Difference]: With dead ends: 24156
[2025-03-03 11:07:24,666 INFO  L226             Difference]: Without dead ends: 15184
[2025-03-03 11:07:24,675 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-03 11:07:24,677 INFO  L435           NwaCegarLoop]: 999 mSDtfsCounter, 575 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1978 mSolverCounterSat, 347 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 2325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 347 IncrementalHoareTripleChecker+Valid, 1978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-03-03 11:07:24,677 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 1006 Invalid, 2325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [347 Valid, 1978 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-03-03 11:07:24,687 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15184 states.
[2025-03-03 11:07:24,785 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15184 to 15184.
[2025-03-03 11:07:24,799 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 15184 states, 15183 states have (on average 1.1337680300335902) internal successors, (17214), 15183 states have internal predecessors, (17214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:24,814 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15184 states to 15184 states and 17214 transitions.
[2025-03-03 11:07:24,814 INFO  L78                 Accepts]: Start accepts. Automaton has 15184 states and 17214 transitions. Word has length 1082
[2025-03-03 11:07:24,815 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:07:24,815 INFO  L471      AbstractCegarLoop]: Abstraction has 15184 states and 17214 transitions.
[2025-03-03 11:07:24,816 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:24,816 INFO  L276                IsEmpty]: Start isEmpty. Operand 15184 states and 17214 transitions.
[2025-03-03 11:07:24,824 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1119
[2025-03-03 11:07:24,824 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:07:24,825 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 11:07:24,825 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-03 11:07:24,825 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:07:24,826 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:07:24,826 INFO  L85        PathProgramCache]: Analyzing trace with hash 213510548, now seen corresponding path program 1 times
[2025-03-03 11:07:24,826 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:07:24,826 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868199952]
[2025-03-03 11:07:24,826 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:07:24,826 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:07:24,883 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1118 statements into 1 equivalence classes.
[2025-03-03 11:07:24,913 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1118 of 1118 statements.
[2025-03-03 11:07:24,913 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:07:24,913 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:07:25,835 INFO  L134       CoverageAnalysis]: Checked inductivity of 1310 backedges. 664 proven. 578 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked.
[2025-03-03 11:07:25,837 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:07:25,837 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868199952]
[2025-03-03 11:07:25,837 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868199952] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 11:07:25,837 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600601297]
[2025-03-03 11:07:25,837 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:07:25,837 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 11:07:25,838 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 11:07:25,839 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 11:07:25,841 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-03 11:07:25,964 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1118 statements into 1 equivalence classes.
[2025-03-03 11:07:26,126 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1118 of 1118 statements.
[2025-03-03 11:07:26,126 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:07:26,126 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:07:26,132 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1306 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 11:07:26,155 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 11:07:26,298 INFO  L134       CoverageAnalysis]: Checked inductivity of 1310 backedges. 638 proven. 0 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked.
[2025-03-03 11:07:26,299 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 11:07:26,299 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [600601297] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:07:26,299 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 11:07:26,299 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9
[2025-03-03 11:07:26,299 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696317797]
[2025-03-03 11:07:26,299 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:07:26,300 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:07:26,300 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:07:26,301 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:07:26,301 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72
[2025-03-03 11:07:26,301 INFO  L87              Difference]: Start difference. First operand 15184 states and 17214 transitions. Second operand  has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:27,909 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:07:27,909 INFO  L93              Difference]: Finished difference Result 34506 states and 39752 transitions.
[2025-03-03 11:07:27,909 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:07:27,909 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1118
[2025-03-03 11:07:27,910 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:07:27,936 INFO  L225             Difference]: With dead ends: 34506
[2025-03-03 11:07:27,937 INFO  L226             Difference]: Without dead ends: 19324
[2025-03-03 11:07:27,950 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1125 GetRequests, 1118 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72
[2025-03-03 11:07:27,951 INFO  L435           NwaCegarLoop]: 207 mSDtfsCounter, 697 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1844 mSolverCounterSat, 498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 2342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 498 IncrementalHoareTripleChecker+Valid, 1844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-03-03 11:07:27,951 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 212 Invalid, 2342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [498 Valid, 1844 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-03-03 11:07:27,966 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 19324 states.
[2025-03-03 11:07:28,085 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 19324 to 19324.
[2025-03-03 11:07:28,103 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 19324 states, 19323 states have (on average 1.1331056254204834) internal successors, (21895), 19323 states have internal predecessors, (21895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:28,120 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19324 states to 19324 states and 21895 transitions.
[2025-03-03 11:07:28,121 INFO  L78                 Accepts]: Start accepts. Automaton has 19324 states and 21895 transitions. Word has length 1118
[2025-03-03 11:07:28,123 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:07:28,123 INFO  L471      AbstractCegarLoop]: Abstraction has 19324 states and 21895 transitions.
[2025-03-03 11:07:28,123 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:28,123 INFO  L276                IsEmpty]: Start isEmpty. Operand 19324 states and 21895 transitions.
[2025-03-03 11:07:28,133 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1160
[2025-03-03 11:07:28,133 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:07:28,134 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 11:07:28,144 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-03-03 11:07:28,338 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 11:07:28,338 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:07:28,338 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:07:28,339 INFO  L85        PathProgramCache]: Analyzing trace with hash 1841988990, now seen corresponding path program 1 times
[2025-03-03 11:07:28,339 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:07:28,339 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484135754]
[2025-03-03 11:07:28,339 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:07:28,339 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:07:28,391 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1159 statements into 1 equivalence classes.
[2025-03-03 11:07:28,422 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1159 of 1159 statements.
[2025-03-03 11:07:28,422 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:07:28,422 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:07:29,156 INFO  L134       CoverageAnalysis]: Checked inductivity of 1389 backedges. 785 proven. 0 refuted. 0 times theorem prover too weak. 604 trivial. 0 not checked.
[2025-03-03 11:07:29,156 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:07:29,156 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484135754]
[2025-03-03 11:07:29,156 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484135754] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:07:29,156 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:07:29,157 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 11:07:29,157 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939513538]
[2025-03-03 11:07:29,157 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:07:29,157 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 11:07:29,158 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:07:29,158 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 11:07:29,158 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 11:07:29,158 INFO  L87              Difference]: Start difference. First operand 19324 states and 21895 transitions. Second operand  has 5 states, 5 states have (on average 135.0) internal successors, (675), 5 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:31,092 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:07:31,093 INFO  L93              Difference]: Finished difference Result 44919 states and 50893 transitions.
[2025-03-03 11:07:31,093 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 11:07:31,094 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 135.0) internal successors, (675), 5 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1159
[2025-03-03 11:07:31,094 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:07:31,124 INFO  L225             Difference]: With dead ends: 44919
[2025-03-03 11:07:31,124 INFO  L226             Difference]: Without dead ends: 22837
[2025-03-03 11:07:31,142 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 11:07:31,142 INFO  L435           NwaCegarLoop]: 1089 mSDtfsCounter, 709 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 3401 mSolverCounterSat, 622 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 4023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 622 IncrementalHoareTripleChecker+Valid, 3401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-03-03 11:07:31,142 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 1108 Invalid, 4023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [622 Valid, 3401 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-03-03 11:07:31,158 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22837 states.
[2025-03-03 11:07:31,279 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22837 to 22084.
[2025-03-03 11:07:31,295 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 22084 states, 22083 states have (on average 1.0762124711316396) internal successors, (23766), 22083 states have internal predecessors, (23766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:31,314 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22084 states to 22084 states and 23766 transitions.
[2025-03-03 11:07:31,314 INFO  L78                 Accepts]: Start accepts. Automaton has 22084 states and 23766 transitions. Word has length 1159
[2025-03-03 11:07:31,315 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:07:31,315 INFO  L471      AbstractCegarLoop]: Abstraction has 22084 states and 23766 transitions.
[2025-03-03 11:07:31,315 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 135.0) internal successors, (675), 5 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:31,315 INFO  L276                IsEmpty]: Start isEmpty. Operand 22084 states and 23766 transitions.
[2025-03-03 11:07:31,325 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1168
[2025-03-03 11:07:31,326 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:07:31,326 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 11:07:31,326 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-03 11:07:31,326 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:07:31,327 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:07:31,327 INFO  L85        PathProgramCache]: Analyzing trace with hash 620970596, now seen corresponding path program 1 times
[2025-03-03 11:07:31,327 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:07:31,327 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116359016]
[2025-03-03 11:07:31,327 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:07:31,328 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:07:31,377 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1167 statements into 1 equivalence classes.
[2025-03-03 11:07:31,414 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1167 of 1167 statements.
[2025-03-03 11:07:31,415 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:07:31,415 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:07:31,780 INFO  L134       CoverageAnalysis]: Checked inductivity of 1410 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 1091 trivial. 0 not checked.
[2025-03-03 11:07:31,780 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:07:31,780 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116359016]
[2025-03-03 11:07:31,780 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116359016] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:07:31,780 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:07:31,780 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 11:07:31,780 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581356279]
[2025-03-03 11:07:31,780 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:07:31,781 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:07:31,781 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:07:31,782 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:07:31,782 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:07:31,782 INFO  L87              Difference]: Start difference. First operand 22084 states and 23766 transitions. Second operand  has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:33,120 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:07:33,120 INFO  L93              Difference]: Finished difference Result 51756 states and 56147 transitions.
[2025-03-03 11:07:33,120 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:07:33,121 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1167
[2025-03-03 11:07:33,121 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:07:33,152 INFO  L225             Difference]: With dead ends: 51756
[2025-03-03 11:07:33,152 INFO  L226             Difference]: Without dead ends: 29674
[2025-03-03 11:07:33,168 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-03 11:07:33,169 INFO  L435           NwaCegarLoop]: 929 mSDtfsCounter, 631 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1771 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 2015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 1771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-03 11:07:33,169 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 936 Invalid, 2015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 1771 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-03 11:07:33,187 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 29674 states.
[2025-03-03 11:07:33,469 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 29674 to 28984.
[2025-03-03 11:07:33,490 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 28984 states, 28983 states have (on average 1.0725252734361523) internal successors, (31085), 28983 states have internal predecessors, (31085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:33,525 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 28984 states to 28984 states and 31085 transitions.
[2025-03-03 11:07:33,525 INFO  L78                 Accepts]: Start accepts. Automaton has 28984 states and 31085 transitions. Word has length 1167
[2025-03-03 11:07:33,526 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:07:33,526 INFO  L471      AbstractCegarLoop]: Abstraction has 28984 states and 31085 transitions.
[2025-03-03 11:07:33,526 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:33,526 INFO  L276                IsEmpty]: Start isEmpty. Operand 28984 states and 31085 transitions.
[2025-03-03 11:07:33,545 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1215
[2025-03-03 11:07:33,546 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:07:33,546 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 11:07:33,546 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-03 11:07:33,547 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:07:33,547 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:07:33,547 INFO  L85        PathProgramCache]: Analyzing trace with hash -1859018549, now seen corresponding path program 1 times
[2025-03-03 11:07:33,547 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:07:33,547 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835965666]
[2025-03-03 11:07:33,548 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:07:33,548 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:07:33,633 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1214 statements into 1 equivalence classes.
[2025-03-03 11:07:33,682 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1214 of 1214 statements.
[2025-03-03 11:07:33,682 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:07:33,682 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:07:34,025 INFO  L134       CoverageAnalysis]: Checked inductivity of 1305 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 1050 trivial. 0 not checked.
[2025-03-03 11:07:34,026 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:07:34,026 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835965666]
[2025-03-03 11:07:34,026 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835965666] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:07:34,026 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:07:34,026 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 11:07:34,026 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571852321]
[2025-03-03 11:07:34,026 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:07:34,027 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:07:34,027 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:07:34,027 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:07:34,028 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:07:34,028 INFO  L87              Difference]: Start difference. First operand 28984 states and 31085 transitions. Second operand  has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:35,483 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:07:35,483 INFO  L93              Difference]: Finished difference Result 65556 states and 70710 transitions.
[2025-03-03 11:07:35,484 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:07:35,484 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1214
[2025-03-03 11:07:35,484 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:07:35,521 INFO  L225             Difference]: With dead ends: 65556
[2025-03-03 11:07:35,521 INFO  L226             Difference]: Without dead ends: 36574
[2025-03-03 11:07:35,541 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-03 11:07:35,541 INFO  L435           NwaCegarLoop]: 279 mSDtfsCounter, 631 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1810 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 2007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-03-03 11:07:35,542 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 285 Invalid, 2007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1810 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-03-03 11:07:35,566 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 36574 states.
[2025-03-03 11:07:35,769 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 36574 to 35884.
[2025-03-03 11:07:35,794 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 35884 states, 35883 states have (on average 1.0683610623414987) internal successors, (38336), 35883 states have internal predecessors, (38336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:35,824 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 35884 states to 35884 states and 38336 transitions.
[2025-03-03 11:07:35,824 INFO  L78                 Accepts]: Start accepts. Automaton has 35884 states and 38336 transitions. Word has length 1214
[2025-03-03 11:07:35,825 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:07:35,825 INFO  L471      AbstractCegarLoop]: Abstraction has 35884 states and 38336 transitions.
[2025-03-03 11:07:35,825 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:35,825 INFO  L276                IsEmpty]: Start isEmpty. Operand 35884 states and 38336 transitions.
[2025-03-03 11:07:35,837 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1241
[2025-03-03 11:07:35,837 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:07:35,837 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 11:07:35,838 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-03 11:07:35,838 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:07:35,838 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:07:35,838 INFO  L85        PathProgramCache]: Analyzing trace with hash -577765789, now seen corresponding path program 1 times
[2025-03-03 11:07:35,838 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:07:35,838 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599368839]
[2025-03-03 11:07:35,839 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:07:35,839 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:07:35,895 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1240 statements into 1 equivalence classes.
[2025-03-03 11:07:35,927 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1240 of 1240 statements.
[2025-03-03 11:07:35,927 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:07:35,927 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:07:36,323 INFO  L134       CoverageAnalysis]: Checked inductivity of 1556 backedges. 884 proven. 0 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked.
[2025-03-03 11:07:36,323 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:07:36,323 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599368839]
[2025-03-03 11:07:36,323 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599368839] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:07:36,323 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:07:36,323 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 11:07:36,323 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877281013]
[2025-03-03 11:07:36,324 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:07:36,324 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:07:36,324 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:07:36,325 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:07:36,325 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:07:36,325 INFO  L87              Difference]: Start difference. First operand 35884 states and 38336 transitions. Second operand  has 3 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:37,602 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:07:37,603 INFO  L93              Difference]: Finished difference Result 80736 states and 86346 transitions.
[2025-03-03 11:07:37,603 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:07:37,603 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1240
[2025-03-03 11:07:37,604 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:07:37,645 INFO  L225             Difference]: With dead ends: 80736
[2025-03-03 11:07:37,645 INFO  L226             Difference]: Without dead ends: 41404
[2025-03-03 11:07:37,669 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-03 11:07:37,670 INFO  L435           NwaCegarLoop]: 932 mSDtfsCounter, 502 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1659 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 1859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 1659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-03 11:07:37,670 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 939 Invalid, 1859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 1659 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-03 11:07:37,698 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 41404 states.
[2025-03-03 11:07:37,908 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 41404 to 40714.
[2025-03-03 11:07:37,930 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 40714 states, 40713 states have (on average 1.0623879350575982) internal successors, (43253), 40713 states have internal predecessors, (43253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:37,961 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 40714 states to 40714 states and 43253 transitions.
[2025-03-03 11:07:37,962 INFO  L78                 Accepts]: Start accepts. Automaton has 40714 states and 43253 transitions. Word has length 1240
[2025-03-03 11:07:37,962 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:07:37,962 INFO  L471      AbstractCegarLoop]: Abstraction has 40714 states and 43253 transitions.
[2025-03-03 11:07:37,962 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:37,962 INFO  L276                IsEmpty]: Start isEmpty. Operand 40714 states and 43253 transitions.
[2025-03-03 11:07:37,979 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1375
[2025-03-03 11:07:37,979 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:07:37,980 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 11:07:37,980 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-03 11:07:37,980 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:07:37,980 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:07:37,981 INFO  L85        PathProgramCache]: Analyzing trace with hash -357703836, now seen corresponding path program 1 times
[2025-03-03 11:07:37,981 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:07:37,981 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060833701]
[2025-03-03 11:07:37,981 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:07:37,981 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:07:38,036 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1374 statements into 1 equivalence classes.
[2025-03-03 11:07:38,071 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1374 of 1374 statements.
[2025-03-03 11:07:38,072 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:07:38,072 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:07:38,488 INFO  L134       CoverageAnalysis]: Checked inductivity of 2173 backedges. 1386 proven. 0 refuted. 0 times theorem prover too weak. 787 trivial. 0 not checked.
[2025-03-03 11:07:38,489 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:07:38,489 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060833701]
[2025-03-03 11:07:38,489 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060833701] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:07:38,489 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:07:38,489 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 11:07:38,489 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583675243]
[2025-03-03 11:07:38,489 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:07:38,490 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:07:38,490 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:07:38,491 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:07:38,491 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:07:38,491 INFO  L87              Difference]: Start difference. First operand 40714 states and 43253 transitions. Second operand  has 3 states, 3 states have (on average 281.6666666666667) internal successors, (845), 3 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:39,906 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:07:39,906 INFO  L93              Difference]: Finished difference Result 90396 states and 96629 transitions.
[2025-03-03 11:07:39,906 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:07:39,906 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 281.6666666666667) internal successors, (845), 3 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1374
[2025-03-03 11:07:39,907 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:07:39,958 INFO  L225             Difference]: With dead ends: 90396
[2025-03-03 11:07:39,958 INFO  L226             Difference]: Without dead ends: 50374
[2025-03-03 11:07:39,985 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-03 11:07:39,986 INFO  L435           NwaCegarLoop]: 957 mSDtfsCounter, 456 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1781 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 2009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 1781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-03 11:07:39,986 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 963 Invalid, 2009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 1781 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-03 11:07:40,020 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 50374 states.
[2025-03-03 11:07:40,487 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 50374 to 50374.
[2025-03-03 11:07:40,521 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 50374 states, 50373 states have (on average 1.0601909753240824) internal successors, (53405), 50373 states have internal predecessors, (53405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:40,582 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 50374 states to 50374 states and 53405 transitions.
[2025-03-03 11:07:40,582 INFO  L78                 Accepts]: Start accepts. Automaton has 50374 states and 53405 transitions. Word has length 1374
[2025-03-03 11:07:40,583 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:07:40,583 INFO  L471      AbstractCegarLoop]: Abstraction has 50374 states and 53405 transitions.
[2025-03-03 11:07:40,583 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 281.6666666666667) internal successors, (845), 3 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:40,583 INFO  L276                IsEmpty]: Start isEmpty. Operand 50374 states and 53405 transitions.
[2025-03-03 11:07:40,614 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1393
[2025-03-03 11:07:40,614 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:07:40,615 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 11:07:40,615 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-03 11:07:40,615 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:07:40,615 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:07:40,616 INFO  L85        PathProgramCache]: Analyzing trace with hash -1948371006, now seen corresponding path program 1 times
[2025-03-03 11:07:40,616 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:07:40,616 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855156652]
[2025-03-03 11:07:40,616 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:07:40,616 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:07:40,706 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1392 statements into 1 equivalence classes.
[2025-03-03 11:07:40,746 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1392 of 1392 statements.
[2025-03-03 11:07:40,746 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:07:40,746 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:07:41,557 INFO  L134       CoverageAnalysis]: Checked inductivity of 2048 backedges. 1435 proven. 0 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked.
[2025-03-03 11:07:41,557 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:07:41,557 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855156652]
[2025-03-03 11:07:41,557 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855156652] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:07:41,557 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:07:41,557 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 11:07:41,557 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055583084]
[2025-03-03 11:07:41,558 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:07:41,558 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 11:07:41,558 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:07:41,559 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 11:07:41,559 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 11:07:41,559 INFO  L87              Difference]: Start difference. First operand 50374 states and 53405 transitions. Second operand  has 4 states, 4 states have (on average 211.5) internal successors, (846), 3 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:43,402 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:07:43,402 INFO  L93              Difference]: Finished difference Result 100746 states and 106822 transitions.
[2025-03-03 11:07:43,403 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 11:07:43,403 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 211.5) internal successors, (846), 3 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1392
[2025-03-03 11:07:43,403 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:07:43,455 INFO  L225             Difference]: With dead ends: 100746
[2025-03-03 11:07:43,455 INFO  L226             Difference]: Without dead ends: 51064
[2025-03-03 11:07:43,487 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 11:07:43,487 INFO  L435           NwaCegarLoop]: 80 mSDtfsCounter, 981 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2673 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 981 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 3022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 2673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2025-03-03 11:07:43,487 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [981 Valid, 91 Invalid, 3022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 2673 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2025-03-03 11:07:43,517 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 51064 states.
[2025-03-03 11:07:43,775 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 51064 to 50374.
[2025-03-03 11:07:43,806 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 50374 states, 50373 states have (on average 1.0599924562761798) internal successors, (53395), 50373 states have internal predecessors, (53395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:43,848 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 50374 states to 50374 states and 53395 transitions.
[2025-03-03 11:07:43,848 INFO  L78                 Accepts]: Start accepts. Automaton has 50374 states and 53395 transitions. Word has length 1392
[2025-03-03 11:07:43,849 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:07:43,849 INFO  L471      AbstractCegarLoop]: Abstraction has 50374 states and 53395 transitions.
[2025-03-03 11:07:43,849 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 211.5) internal successors, (846), 3 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:43,849 INFO  L276                IsEmpty]: Start isEmpty. Operand 50374 states and 53395 transitions.
[2025-03-03 11:07:43,935 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1434
[2025-03-03 11:07:43,935 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:07:43,935 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 11:07:43,935 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-03 11:07:43,935 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:07:43,936 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:07:43,936 INFO  L85        PathProgramCache]: Analyzing trace with hash -1560827467, now seen corresponding path program 1 times
[2025-03-03 11:07:43,936 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:07:43,936 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126436730]
[2025-03-03 11:07:43,936 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:07:43,936 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:07:43,989 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1433 statements into 1 equivalence classes.
[2025-03-03 11:07:44,024 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1433 of 1433 statements.
[2025-03-03 11:07:44,024 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:07:44,024 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:07:44,983 INFO  L134       CoverageAnalysis]: Checked inductivity of 2176 backedges. 1231 proven. 3 refuted. 0 times theorem prover too weak. 942 trivial. 0 not checked.
[2025-03-03 11:07:44,984 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:07:44,984 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126436730]
[2025-03-03 11:07:44,984 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126436730] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 11:07:44,984 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114602234]
[2025-03-03 11:07:44,984 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:07:44,984 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 11:07:44,984 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 11:07:44,986 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 11:07:44,987 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-03-03 11:07:45,070 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1433 statements into 1 equivalence classes.
[2025-03-03 11:07:45,211 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1433 of 1433 statements.
[2025-03-03 11:07:45,211 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:07:45,211 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:07:45,216 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1650 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 11:07:45,224 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 11:07:45,579 INFO  L134       CoverageAnalysis]: Checked inductivity of 2176 backedges. 1170 proven. 0 refuted. 0 times theorem prover too weak. 1006 trivial. 0 not checked.
[2025-03-03 11:07:45,580 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 11:07:45,580 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114602234] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:07:45,580 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 11:07:45,580 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8
[2025-03-03 11:07:45,581 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832797702]
[2025-03-03 11:07:45,581 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:07:45,582 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:07:45,582 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:07:45,582 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:07:45,583 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56
[2025-03-03 11:07:45,583 INFO  L87              Difference]: Start difference. First operand 50374 states and 53395 transitions. Second operand  has 3 states, 3 states have (on average 284.6666666666667) internal successors, (854), 3 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:46,988 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:07:46,988 INFO  L93              Difference]: Finished difference Result 100056 states and 106097 transitions.
[2025-03-03 11:07:46,989 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:07:46,990 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 284.6666666666667) internal successors, (854), 3 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1433
[2025-03-03 11:07:46,990 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:07:47,036 INFO  L225             Difference]: With dead ends: 100056
[2025-03-03 11:07:47,036 INFO  L226             Difference]: Without dead ends: 50374
[2025-03-03 11:07:47,068 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1439 GetRequests, 1433 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56
[2025-03-03 11:07:47,068 INFO  L435           NwaCegarLoop]: 881 mSDtfsCounter, 425 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1605 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 1825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-03 11:07:47,069 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 888 Invalid, 1825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 1605 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-03 11:07:47,106 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 50374 states.
[2025-03-03 11:07:47,417 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 50374 to 49684.
[2025-03-03 11:07:47,448 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 49684 states, 49683 states have (on average 1.0433951250930902) internal successors, (51839), 49683 states have internal predecessors, (51839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:47,488 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 49684 states to 49684 states and 51839 transitions.
[2025-03-03 11:07:47,489 INFO  L78                 Accepts]: Start accepts. Automaton has 49684 states and 51839 transitions. Word has length 1433
[2025-03-03 11:07:47,489 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:07:47,489 INFO  L471      AbstractCegarLoop]: Abstraction has 49684 states and 51839 transitions.
[2025-03-03 11:07:47,489 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 284.6666666666667) internal successors, (854), 3 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:47,490 INFO  L276                IsEmpty]: Start isEmpty. Operand 49684 states and 51839 transitions.
[2025-03-03 11:07:47,571 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1451
[2025-03-03 11:07:47,571 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:07:47,572 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 11:07:47,579 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-03-03 11:07:47,772 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2025-03-03 11:07:47,772 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:07:47,773 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:07:47,773 INFO  L85        PathProgramCache]: Analyzing trace with hash 1924241020, now seen corresponding path program 1 times
[2025-03-03 11:07:47,773 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:07:47,773 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131283899]
[2025-03-03 11:07:47,773 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:07:47,774 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:07:47,829 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1450 statements into 1 equivalence classes.
[2025-03-03 11:07:47,866 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1450 of 1450 statements.
[2025-03-03 11:07:47,866 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:07:47,866 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:07:48,265 INFO  L134       CoverageAnalysis]: Checked inductivity of 1832 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 1577 trivial. 0 not checked.
[2025-03-03 11:07:48,265 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:07:48,265 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131283899]
[2025-03-03 11:07:48,265 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131283899] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:07:48,265 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:07:48,265 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 11:07:48,265 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872011224]
[2025-03-03 11:07:48,265 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:07:48,266 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:07:48,266 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:07:48,268 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:07:48,268 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:07:48,268 INFO  L87              Difference]: Start difference. First operand 49684 states and 51839 transitions. Second operand  has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:49,563 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:07:49,563 INFO  L93              Difference]: Finished difference Result 99366 states and 103681 transitions.
[2025-03-03 11:07:49,564 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:07:49,564 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1450
[2025-03-03 11:07:49,565 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:07:49,607 INFO  L225             Difference]: With dead ends: 99366
[2025-03-03 11:07:49,607 INFO  L226             Difference]: Without dead ends: 50374
[2025-03-03 11:07:49,632 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-03 11:07:49,632 INFO  L435           NwaCegarLoop]: 60 mSDtfsCounter, 643 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 1977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-03 11:07:49,633 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 66 Invalid, 1977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-03 11:07:49,659 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 50374 states.
[2025-03-03 11:07:49,995 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 50374 to 48994.
[2025-03-03 11:07:50,028 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 48994 states, 48993 states have (on average 1.0425775110730104) internal successors, (51079), 48993 states have internal predecessors, (51079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:50,085 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 48994 states to 48994 states and 51079 transitions.
[2025-03-03 11:07:50,086 INFO  L78                 Accepts]: Start accepts. Automaton has 48994 states and 51079 transitions. Word has length 1450
[2025-03-03 11:07:50,087 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:07:50,087 INFO  L471      AbstractCegarLoop]: Abstraction has 48994 states and 51079 transitions.
[2025-03-03 11:07:50,087 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:50,087 INFO  L276                IsEmpty]: Start isEmpty. Operand 48994 states and 51079 transitions.
[2025-03-03 11:07:50,121 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1509
[2025-03-03 11:07:50,121 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 11:07:50,122 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 11:07:50,122 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-03 11:07:50,122 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 11:07:50,123 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 11:07:50,123 INFO  L85        PathProgramCache]: Analyzing trace with hash -223232720, now seen corresponding path program 1 times
[2025-03-03 11:07:50,123 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 11:07:50,123 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116971800]
[2025-03-03 11:07:50,123 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 11:07:50,123 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 11:07:50,223 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1508 statements into 1 equivalence classes.
[2025-03-03 11:07:50,282 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1508 of 1508 statements.
[2025-03-03 11:07:50,282 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 11:07:50,282 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 11:07:51,443 INFO  L134       CoverageAnalysis]: Checked inductivity of 2035 backedges. 1181 proven. 0 refuted. 0 times theorem prover too weak. 854 trivial. 0 not checked.
[2025-03-03 11:07:51,443 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 11:07:51,443 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116971800]
[2025-03-03 11:07:51,443 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116971800] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 11:07:51,443 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 11:07:51,443 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 11:07:51,443 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722145007]
[2025-03-03 11:07:51,443 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 11:07:51,444 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 11:07:51,444 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 11:07:51,445 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 11:07:51,445 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 11:07:51,445 INFO  L87              Difference]: Start difference. First operand 48994 states and 51079 transitions. Second operand  has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:52,635 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 11:07:52,635 INFO  L93              Difference]: Finished difference Result 97294 states and 101464 transitions.
[2025-03-03 11:07:52,635 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 11:07:52,636 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1508
[2025-03-03 11:07:52,636 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 11:07:52,637 INFO  L225             Difference]: With dead ends: 97294
[2025-03-03 11:07:52,637 INFO  L226             Difference]: Without dead ends: 0
[2025-03-03 11:07:52,668 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-03 11:07:52,669 INFO  L435           NwaCegarLoop]: 737 mSDtfsCounter, 370 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1673 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 1830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-03 11:07:52,669 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 743 Invalid, 1830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1673 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-03 11:07:52,669 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-03-03 11:07:52,669 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-03-03 11:07:52,669 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:52,669 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-03-03 11:07:52,669 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1508
[2025-03-03 11:07:52,669 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 11:07:52,669 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-03-03 11:07:52,670 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 11:07:52,670 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-03-03 11:07:52,670 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2025-03-03 11:07:52,672 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-03-03 11:07:52,673 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-03 11:07:52,674 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 11:07:52,676 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2025-03-03 11:07:53,187 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-03 11:07:53,198 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:07:53 BoogieIcfgContainer
[2025-03-03 11:07:53,199 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-03 11:07:53,199 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-03 11:07:53,199 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-03 11:07:53,200 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-03 11:07:53,200 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:07:06" (3/4) ...
[2025-03-03 11:07:53,202 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-03-03 11:07:53,237 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges
[2025-03-03 11:07:53,241 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2025-03-03 11:07:53,244 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-03-03 11:07:53,247 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-03-03 11:07:53,429 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-03-03 11:07:53,429 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-03-03 11:07:53,429 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-03 11:07:53,430 INFO  L158              Benchmark]: Toolchain (without parser) took 50797.61ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 113.1MB in the beginning and 207.7MB in the end (delta: -94.6MB). Peak memory consumption was 908.9MB. Max. memory is 16.1GB.
[2025-03-03 11:07:53,430 INFO  L158              Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-03 11:07:53,430 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 863.33ms. Allocated memory is still 167.8MB. Free memory was 112.4MB in the beginning and 81.3MB in the end (delta: 31.1MB). Peak memory consumption was 101.0MB. Max. memory is 16.1GB.
[2025-03-03 11:07:53,430 INFO  L158              Benchmark]: Boogie Procedure Inliner took 182.33ms. Allocated memory is still 167.8MB. Free memory was 81.3MB in the beginning and 98.4MB in the end (delta: -17.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
[2025-03-03 11:07:53,430 INFO  L158              Benchmark]: Boogie Preprocessor took 222.72ms. Allocated memory is still 167.8MB. Free memory was 98.4MB in the beginning and 89.9MB in the end (delta: 8.5MB). Peak memory consumption was 58.4MB. Max. memory is 16.1GB.
[2025-03-03 11:07:53,430 INFO  L158              Benchmark]: IcfgBuilder took 2842.44ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 89.9MB in the beginning and 262.2MB in the end (delta: -172.2MB). Peak memory consumption was 238.2MB. Max. memory is 16.1GB.
[2025-03-03 11:07:53,431 INFO  L158              Benchmark]: TraceAbstraction took 46450.59ms. Allocated memory was 402.7MB in the beginning and 1.2GB in the end (delta: 771.8MB). Free memory was 262.2MB in the beginning and 253.5MB in the end (delta: 8.6MB). Peak memory consumption was 784.0MB. Max. memory is 16.1GB.
[2025-03-03 11:07:53,431 INFO  L158              Benchmark]: Witness Printer took 229.62ms. Allocated memory is still 1.2GB. Free memory was 253.5MB in the beginning and 207.7MB in the end (delta: 45.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB.
[2025-03-03 11:07:53,432 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 863.33ms. Allocated memory is still 167.8MB. Free memory was 112.4MB in the beginning and 81.3MB in the end (delta: 31.1MB). Peak memory consumption was 101.0MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 182.33ms. Allocated memory is still 167.8MB. Free memory was 81.3MB in the beginning and 98.4MB in the end (delta: -17.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 222.72ms. Allocated memory is still 167.8MB. Free memory was 98.4MB in the beginning and 89.9MB in the end (delta: 8.5MB). Peak memory consumption was 58.4MB. Max. memory is 16.1GB.
 * IcfgBuilder took 2842.44ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 89.9MB in the beginning and 262.2MB in the end (delta: -172.2MB). Peak memory consumption was 238.2MB. Max. memory is 16.1GB.
 * TraceAbstraction took 46450.59ms. Allocated memory was 402.7MB in the beginning and 1.2GB in the end (delta: 771.8MB). Free memory was 262.2MB in the beginning and 253.5MB in the end (delta: 8.6MB). Peak memory consumption was 784.0MB. Max. memory is 16.1GB.
 * Witness Printer took 229.62ms. Allocated memory is still 1.2GB. Free memory was 253.5MB in the beginning and 207.7MB in the end (delta: 45.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Line: 217]: a call to reach_error is unreachable
    For all program executions holds that a call to reach_error is unreachable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 757 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 45.9s, OverallIterations: 16, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.4s, AutomataDifference: 29.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11674 SdHoareTripleChecker+Valid, 26.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11674 mSDsluCounter, 9148 SdHoareTripleChecker+Invalid, 21.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 146 mSDsCounter, 7712 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36139 IncrementalHoareTripleChecker+Invalid, 43851 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7712 mSolverCounterUnsat, 9002 mSDtfsCounter, 36139 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2611 GetRequests, 2576 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50374occurred in iteration=12, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 7655 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 19325 NumberOfCodeBlocks, 19325 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 19307 ConstructedInterpolants, 0 QuantifiedInterpolants, 43666 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2956 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 18 InterpolantComputations, 16 PerfectInterpolantSequences, 23177/23758 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
  - InvariantResult [Line: 4269]: Location Invariant
    Derived location invariant: ((((((((((6 <= a15) && (a24 <= 3)) && (a18 == 12)) || ((a24 == 0) && (a15 <= 4))) || ((a18 <= 11) && (a24 <= 3))) || (((a15 <= 4) && (a18 == 12)) && (a24 != 2))) || (((a15 != 4) && (a18 == 12)) && (a15 <= 5))) || ((a18 <= 11) && (a15 <= 5))) || ((a24 == 1) && (a15 <= 4))) || (((6 <= a15) && (a24 == 1)) && (a3 <= 99)))
RESULT: Ultimate proved your program to be correct!
[2025-03-03 11:07:53,446 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE