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


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


Checking for ERROR reachability
Using default analysis
Version 8be7027f
Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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/Problem02_label51.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 df07a51f7e516d27edfc43ba7975842330a5e8f5d0694898dfea4c8b236ae732
--- Real Ultimate output ---
This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m
[2024-11-11 16:06:35,594 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-11 16:06:35,650 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-11 16:06:35,654 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-11 16:06:35,656 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-11 16:06:35,704 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-11 16:06:35,705 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-11 16:06:35,705 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-11 16:06:35,705 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-11 16:06:35,706 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-11 16:06:35,706 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-11 16:06:35,706 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-11 16:06:35,707 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-11 16:06:35,707 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-11 16:06:35,709 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-11 16:06:35,733 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-11 16:06:35,734 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-11 16:06:35,734 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-11 16:06:35,734 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-11 16:06:35,734 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-11 16:06:35,734 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-11 16:06:35,737 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-11 16:06:35,738 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-11 16:06:35,738 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-11 16:06:35,738 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-11 16:06:35,738 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-11 16:06:35,738 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-11 16:06:35,738 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-11 16:06:35,739 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-11 16:06:35,739 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-11 16:06:35,739 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-11 16:06:35,739 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-11 16:06:35,739 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-11 16:06:35,739 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-11 16:06:35,739 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-11 16:06:35,740 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-11 16:06:35,740 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-11 16:06:35,740 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-11 16:06:35,740 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-11 16:06:35,740 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-11 16:06:35,740 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-11 16:06:35,744 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-11 16:06:35,744 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
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 -> df07a51f7e516d27edfc43ba7975842330a5e8f5d0694898dfea4c8b236ae732
[2024-11-11 16:06:35,974 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-11 16:06:36,001 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-11 16:06:36,005 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-11 16:06:36,006 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-11 16:06:36,006 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-11 16:06:36,007 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label51.c
[2024-11-11 16:06:37,382 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-11 16:06:37,679 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-11 16:06:37,682 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label51.c
[2024-11-11 16:06:37,695 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bf4ab072/663d8192c9c34971a4f9687e04abbbe8/FLAG7ee53bffc
[2024-11-11 16:06:37,708 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bf4ab072/663d8192c9c34971a4f9687e04abbbe8
[2024-11-11 16:06:37,711 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-11 16:06:37,712 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-11 16:06:37,714 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-11 16:06:37,714 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-11 16:06:37,719 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-11 16:06:37,719 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:06:37" (1/1) ...
[2024-11-11 16:06:37,721 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17ac1b90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:06:37, skipping insertion in model container
[2024-11-11 16:06:37,721 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:06:37" (1/1) ...
[2024-11-11 16:06:37,757 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-11 16:06:38,038 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/Problem02_label51.c[17924,17937]
[2024-11-11 16:06:38,068 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-11 16:06:38,082 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-11 16:06:38,137 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/Problem02_label51.c[17924,17937]
[2024-11-11 16:06:38,145 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-11 16:06:38,167 INFO  L204         MainTranslator]: Completed translation
[2024-11-11 16:06:38,168 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:06:38 WrapperNode
[2024-11-11 16:06:38,168 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-11 16:06:38,169 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-11 16:06:38,169 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-11 16:06:38,169 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-11 16:06:38,182 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:06:38" (1/1) ...
[2024-11-11 16:06:38,205 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:06:38" (1/1) ...
[2024-11-11 16:06:38,252 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669
[2024-11-11 16:06:38,253 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-11 16:06:38,253 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-11 16:06:38,254 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-11 16:06:38,254 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-11 16:06:38,262 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:06:38" (1/1) ...
[2024-11-11 16:06:38,263 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:06:38" (1/1) ...
[2024-11-11 16:06:38,269 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:06:38" (1/1) ...
[2024-11-11 16:06:38,297 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].
[2024-11-11 16:06:38,297 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:06:38" (1/1) ...
[2024-11-11 16:06:38,297 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:06:38" (1/1) ...
[2024-11-11 16:06:38,320 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:06:38" (1/1) ...
[2024-11-11 16:06:38,331 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:06:38" (1/1) ...
[2024-11-11 16:06:38,338 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:06:38" (1/1) ...
[2024-11-11 16:06:38,345 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:06:38" (1/1) ...
[2024-11-11 16:06:38,354 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-11 16:06:38,357 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-11 16:06:38,357 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-11 16:06:38,357 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-11 16:06:38,357 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:06:38" (1/1) ...
[2024-11-11 16:06:38,362 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-11 16:06:38,371 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-11 16:06:38,384 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)
[2024-11-11 16:06:38,385 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
[2024-11-11 16:06:38,421 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-11 16:06:38,421 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-11 16:06:38,421 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-11 16:06:38,421 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-11 16:06:38,476 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-11 16:06:38,477 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-11 16:06:39,304 INFO  L?                        ?]: Removed 84 outVars from TransFormulas that were not future-live.
[2024-11-11 16:06:39,304 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-11 16:06:39,323 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-11 16:06:39,323 INFO  L316             CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-11 16:06:39,325 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:06:39 BoogieIcfgContainer
[2024-11-11 16:06:39,325 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-11 16:06:39,326 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-11 16:06:39,327 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-11 16:06:39,330 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-11 16:06:39,330 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 04:06:37" (1/3) ...
[2024-11-11 16:06:39,331 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68518fbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:06:39, skipping insertion in model container
[2024-11-11 16:06:39,331 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:06:38" (2/3) ...
[2024-11-11 16:06:39,332 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68518fbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:06:39, skipping insertion in model container
[2024-11-11 16:06:39,333 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:06:39" (3/3) ...
[2024-11-11 16:06:39,334 INFO  L112   eAbstractionObserver]: Analyzing ICFG Problem02_label51.c
[2024-11-11 16:06:39,348 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-11 16:06:39,348 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-11 16:06:39,422 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-11 16:06:39,427 INFO  L333      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@41ae2664, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-11 16:06:39,427 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-11 16:06:39,430 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:06:39,439 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 111
[2024-11-11 16:06:39,440 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 16:06:39,440 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-11 16:06:39,441 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 16:06:39,447 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 16:06:39,448 INFO  L85        PathProgramCache]: Analyzing trace with hash -1025900355, now seen corresponding path program 1 times
[2024-11-11 16:06:39,455 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 16:06:39,455 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423175666]
[2024-11-11 16:06:39,456 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 16:06:39,456 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 16:06:39,589 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 16:06:39,882 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-11 16:06:39,883 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 16:06:39,883 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423175666]
[2024-11-11 16:06:39,884 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423175666] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 16:06:39,884 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 16:06:39,884 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-11 16:06:39,885 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939513948]
[2024-11-11 16:06:39,886 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 16:06:39,889 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 16:06:39,891 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 16:06:39,909 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 16:06:39,910 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 16:06:39,912 INFO  L87              Difference]: Start difference. First operand  has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:06:40,453 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 16:06:40,454 INFO  L93              Difference]: Finished difference Result 600 states and 1037 transitions.
[2024-11-11 16:06:40,455 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 16:06:40,456 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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 110
[2024-11-11 16:06:40,457 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 16:06:40,465 INFO  L225             Difference]: With dead ends: 600
[2024-11-11 16:06:40,465 INFO  L226             Difference]: Without dead ends: 309
[2024-11-11 16:06:40,468 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
[2024-11-11 16:06:40,470 INFO  L435           NwaCegarLoop]: 150 mSDtfsCounter, 56 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-11 16:06:40,471 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 171 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-11 16:06:40,485 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 309 states.
[2024-11-11 16:06:40,505 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307.
[2024-11-11 16:06:40,507 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 307 states, 306 states have (on average 1.3300653594771241) internal successors, (407), 306 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:06:40,508 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 407 transitions.
[2024-11-11 16:06:40,509 INFO  L78                 Accepts]: Start accepts. Automaton has 307 states and 407 transitions. Word has length 110
[2024-11-11 16:06:40,510 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 16:06:40,510 INFO  L471      AbstractCegarLoop]: Abstraction has 307 states and 407 transitions.
[2024-11-11 16:06:40,510 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:06:40,511 INFO  L276                IsEmpty]: Start isEmpty. Operand 307 states and 407 transitions.
[2024-11-11 16:06:40,512 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 116
[2024-11-11 16:06:40,512 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 16:06:40,513 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2024-11-11 16:06:40,513 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-11 16:06:40,513 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 16:06:40,514 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 16:06:40,514 INFO  L85        PathProgramCache]: Analyzing trace with hash -2125947768, now seen corresponding path program 1 times
[2024-11-11 16:06:40,514 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 16:06:40,514 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764753240]
[2024-11-11 16:06:40,514 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 16:06:40,514 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 16:06:40,545 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 16:06:40,641 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-11 16:06:40,642 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 16:06:40,642 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764753240]
[2024-11-11 16:06:40,642 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764753240] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 16:06:40,642 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 16:06:40,642 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-11 16:06:40,642 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387711675]
[2024-11-11 16:06:40,642 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 16:06:40,643 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 16:06:40,644 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 16:06:40,648 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 16:06:40,648 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 16:06:40,648 INFO  L87              Difference]: Start difference. First operand 307 states and 407 transitions. Second operand  has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:06:41,029 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 16:06:41,030 INFO  L93              Difference]: Finished difference Result 758 states and 1034 transitions.
[2024-11-11 16:06:41,030 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 16:06:41,030 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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 115
[2024-11-11 16:06:41,031 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 16:06:41,032 INFO  L225             Difference]: With dead ends: 758
[2024-11-11 16:06:41,032 INFO  L226             Difference]: Without dead ends: 453
[2024-11-11 16:06:41,034 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
[2024-11-11 16:06:41,034 INFO  L435           NwaCegarLoop]: 230 mSDtfsCounter, 54 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-11 16:06:41,035 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 248 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-11 16:06:41,036 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 453 states.
[2024-11-11 16:06:41,050 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 453.
[2024-11-11 16:06:41,051 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 453 states, 452 states have (on average 1.2787610619469028) internal successors, (578), 452 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:06:41,052 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 578 transitions.
[2024-11-11 16:06:41,052 INFO  L78                 Accepts]: Start accepts. Automaton has 453 states and 578 transitions. Word has length 115
[2024-11-11 16:06:41,053 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 16:06:41,053 INFO  L471      AbstractCegarLoop]: Abstraction has 453 states and 578 transitions.
[2024-11-11 16:06:41,053 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:06:41,053 INFO  L276                IsEmpty]: Start isEmpty. Operand 453 states and 578 transitions.
[2024-11-11 16:06:41,056 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 128
[2024-11-11 16:06:41,056 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 16:06:41,056 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2024-11-11 16:06:41,056 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-11 16:06:41,057 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 16:06:41,057 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 16:06:41,057 INFO  L85        PathProgramCache]: Analyzing trace with hash 1051159181, now seen corresponding path program 1 times
[2024-11-11 16:06:41,057 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 16:06:41,057 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861713315]
[2024-11-11 16:06:41,058 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 16:06:41,058 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 16:06:41,081 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 16:06:41,155 INFO  L134       CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-11 16:06:41,156 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 16:06:41,157 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861713315]
[2024-11-11 16:06:41,157 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861713315] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 16:06:41,157 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 16:06:41,158 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-11 16:06:41,158 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315129703]
[2024-11-11 16:06:41,158 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 16:06:41,159 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 16:06:41,160 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 16:06:41,160 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 16:06:41,161 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 16:06:41,161 INFO  L87              Difference]: Start difference. First operand 453 states and 578 transitions. Second operand  has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:06:41,542 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 16:06:41,543 INFO  L93              Difference]: Finished difference Result 1325 states and 1691 transitions.
[2024-11-11 16:06:41,543 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 16:06:41,543 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 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 127
[2024-11-11 16:06:41,544 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 16:06:41,546 INFO  L225             Difference]: With dead ends: 1325
[2024-11-11 16:06:41,546 INFO  L226             Difference]: Without dead ends: 874
[2024-11-11 16:06:41,547 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
[2024-11-11 16:06:41,548 INFO  L435           NwaCegarLoop]: 64 mSDtfsCounter, 183 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-11 16:06:41,549 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 81 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-11 16:06:41,550 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 874 states.
[2024-11-11 16:06:41,570 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874.
[2024-11-11 16:06:41,571 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 874 states, 873 states have (on average 1.2290950744558993) internal successors, (1073), 873 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:06:41,573 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1073 transitions.
[2024-11-11 16:06:41,574 INFO  L78                 Accepts]: Start accepts. Automaton has 874 states and 1073 transitions. Word has length 127
[2024-11-11 16:06:41,574 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 16:06:41,574 INFO  L471      AbstractCegarLoop]: Abstraction has 874 states and 1073 transitions.
[2024-11-11 16:06:41,574 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:06:41,575 INFO  L276                IsEmpty]: Start isEmpty. Operand 874 states and 1073 transitions.
[2024-11-11 16:06:41,577 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 157
[2024-11-11 16:06:41,578 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 16:06:41,578 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2024-11-11 16:06:41,578 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-11 16:06:41,579 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 16:06:41,579 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 16:06:41,579 INFO  L85        PathProgramCache]: Analyzing trace with hash -1929461552, now seen corresponding path program 1 times
[2024-11-11 16:06:41,579 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 16:06:41,580 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704694442]
[2024-11-11 16:06:41,580 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 16:06:41,580 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 16:06:41,610 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 16:06:41,725 INFO  L134       CoverageAnalysis]: Checked inductivity of 66 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2024-11-11 16:06:41,725 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 16:06:41,725 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704694442]
[2024-11-11 16:06:41,725 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704694442] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 16:06:41,725 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 16:06:41,725 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-11 16:06:41,726 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272711433]
[2024-11-11 16:06:41,726 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 16:06:41,726 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 16:06:41,726 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 16:06:41,727 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 16:06:41,727 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 16:06:41,727 INFO  L87              Difference]: Start difference. First operand 874 states and 1073 transitions. Second operand  has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:06:42,064 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 16:06:42,064 INFO  L93              Difference]: Finished difference Result 2028 states and 2468 transitions.
[2024-11-11 16:06:42,064 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 16:06:42,065 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 156
[2024-11-11 16:06:42,065 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 16:06:42,069 INFO  L225             Difference]: With dead ends: 2028
[2024-11-11 16:06:42,069 INFO  L226             Difference]: Without dead ends: 1014
[2024-11-11 16:06:42,070 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
[2024-11-11 16:06:42,071 INFO  L435           NwaCegarLoop]: 59 mSDtfsCounter, 158 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-11 16:06:42,072 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 66 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-11 16:06:42,073 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1014 states.
[2024-11-11 16:06:42,084 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 1012.
[2024-11-11 16:06:42,085 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1012 states, 1011 states have (on average 1.142433234421365) internal successors, (1155), 1011 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:06:42,087 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1155 transitions.
[2024-11-11 16:06:42,088 INFO  L78                 Accepts]: Start accepts. Automaton has 1012 states and 1155 transitions. Word has length 156
[2024-11-11 16:06:42,088 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 16:06:42,088 INFO  L471      AbstractCegarLoop]: Abstraction has 1012 states and 1155 transitions.
[2024-11-11 16:06:42,088 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:06:42,088 INFO  L276                IsEmpty]: Start isEmpty. Operand 1012 states and 1155 transitions.
[2024-11-11 16:06:42,090 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 161
[2024-11-11 16:06:42,090 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 16:06:42,091 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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]
[2024-11-11 16:06:42,091 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-11 16:06:42,091 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 16:06:42,092 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 16:06:42,092 INFO  L85        PathProgramCache]: Analyzing trace with hash 853148314, now seen corresponding path program 1 times
[2024-11-11 16:06:42,092 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 16:06:42,092 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148596677]
[2024-11-11 16:06:42,092 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 16:06:42,092 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 16:06:42,116 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 16:06:42,166 INFO  L134       CoverageAnalysis]: Checked inductivity of 78 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2024-11-11 16:06:42,169 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 16:06:42,169 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148596677]
[2024-11-11 16:06:42,169 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148596677] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 16:06:42,169 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 16:06:42,170 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-11 16:06:42,170 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935909545]
[2024-11-11 16:06:42,170 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 16:06:42,170 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 16:06:42,170 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 16:06:42,171 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 16:06:42,171 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 16:06:42,171 INFO  L87              Difference]: Start difference. First operand 1012 states and 1155 transitions. Second operand  has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:06:42,489 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 16:06:42,489 INFO  L93              Difference]: Finished difference Result 2870 states and 3282 transitions.
[2024-11-11 16:06:42,490 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 16:06:42,490 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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 160
[2024-11-11 16:06:42,490 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 16:06:42,494 INFO  L225             Difference]: With dead ends: 2870
[2024-11-11 16:06:42,494 INFO  L226             Difference]: Without dead ends: 1860
[2024-11-11 16:06:42,496 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
[2024-11-11 16:06:42,496 INFO  L435           NwaCegarLoop]: 238 mSDtfsCounter, 137 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-11 16:06:42,497 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 263 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-11 16:06:42,503 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1860 states.
[2024-11-11 16:06:42,536 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1854.
[2024-11-11 16:06:42,541 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1854 states, 1853 states have (on average 1.119805720453319) internal successors, (2075), 1853 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:06:42,548 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2075 transitions.
[2024-11-11 16:06:42,552 INFO  L78                 Accepts]: Start accepts. Automaton has 1854 states and 2075 transitions. Word has length 160
[2024-11-11 16:06:42,552 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 16:06:42,553 INFO  L471      AbstractCegarLoop]: Abstraction has 1854 states and 2075 transitions.
[2024-11-11 16:06:42,553 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:06:42,553 INFO  L276                IsEmpty]: Start isEmpty. Operand 1854 states and 2075 transitions.
[2024-11-11 16:06:42,568 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 165
[2024-11-11 16:06:42,568 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 16:06:42,568 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2024-11-11 16:06:42,569 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-11 16:06:42,569 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 16:06:42,569 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 16:06:42,570 INFO  L85        PathProgramCache]: Analyzing trace with hash 1115795639, now seen corresponding path program 1 times
[2024-11-11 16:06:42,570 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 16:06:42,570 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269779519]
[2024-11-11 16:06:42,570 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 16:06:42,570 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 16:06:42,596 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 16:06:42,687 INFO  L134       CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-11 16:06:42,687 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 16:06:42,688 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269779519]
[2024-11-11 16:06:42,688 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269779519] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 16:06:42,688 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 16:06:42,689 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-11 16:06:42,689 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741658453]
[2024-11-11 16:06:42,689 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 16:06:42,690 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 16:06:42,690 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 16:06:42,690 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 16:06:42,690 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 16:06:42,691 INFO  L87              Difference]: Start difference. First operand 1854 states and 2075 transitions. Second operand  has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:06:42,988 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 16:06:42,989 INFO  L93              Difference]: Finished difference Result 3411 states and 3826 transitions.
[2024-11-11 16:06:42,993 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 16:06:42,994 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 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 164
[2024-11-11 16:06:42,994 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 16:06:42,997 INFO  L225             Difference]: With dead ends: 3411
[2024-11-11 16:06:42,997 INFO  L226             Difference]: Without dead ends: 1417
[2024-11-11 16:06:42,999 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
[2024-11-11 16:06:43,003 INFO  L435           NwaCegarLoop]: 19 mSDtfsCounter, 138 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-11 16:06:43,004 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 19 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-11 16:06:43,005 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1417 states.
[2024-11-11 16:06:43,038 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 1417.
[2024-11-11 16:06:43,040 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1417 states, 1416 states have (on average 1.0748587570621468) internal successors, (1522), 1416 states have internal predecessors, (1522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:06:43,046 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 1522 transitions.
[2024-11-11 16:06:43,046 INFO  L78                 Accepts]: Start accepts. Automaton has 1417 states and 1522 transitions. Word has length 164
[2024-11-11 16:06:43,047 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 16:06:43,047 INFO  L471      AbstractCegarLoop]: Abstraction has 1417 states and 1522 transitions.
[2024-11-11 16:06:43,047 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:06:43,047 INFO  L276                IsEmpty]: Start isEmpty. Operand 1417 states and 1522 transitions.
[2024-11-11 16:06:43,049 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 183
[2024-11-11 16:06:43,049 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 16:06:43,049 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, 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]
[2024-11-11 16:06:43,050 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-11 16:06:43,050 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 16:06:43,050 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 16:06:43,056 INFO  L85        PathProgramCache]: Analyzing trace with hash 601847238, now seen corresponding path program 1 times
[2024-11-11 16:06:43,056 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 16:06:43,056 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364022483]
[2024-11-11 16:06:43,057 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 16:06:43,057 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 16:06:43,111 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 16:06:43,221 INFO  L134       CoverageAnalysis]: Checked inductivity of 98 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-11 16:06:43,222 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 16:06:43,222 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364022483]
[2024-11-11 16:06:43,222 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364022483] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 16:06:43,222 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 16:06:43,222 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-11 16:06:43,222 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515755708]
[2024-11-11 16:06:43,222 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 16:06:43,222 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 16:06:43,222 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 16:06:43,223 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 16:06:43,223 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 16:06:43,223 INFO  L87              Difference]: Start difference. First operand 1417 states and 1522 transitions. Second operand  has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:06:43,639 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 16:06:43,640 INFO  L93              Difference]: Finished difference Result 3111 states and 3346 transitions.
[2024-11-11 16:06:43,640 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 16:06:43,640 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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 182
[2024-11-11 16:06:43,640 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 16:06:43,647 INFO  L225             Difference]: With dead ends: 3111
[2024-11-11 16:06:43,647 INFO  L226             Difference]: Without dead ends: 1836
[2024-11-11 16:06:43,648 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
[2024-11-11 16:06:43,649 INFO  L435           NwaCegarLoop]: 26 mSDtfsCounter, 129 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-11 16:06:43,649 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 31 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-11 16:06:43,654 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1836 states.
[2024-11-11 16:06:43,680 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 1416.
[2024-11-11 16:06:43,682 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1416 states, 1415 states have (on average 1.0734982332155476) internal successors, (1519), 1415 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:06:43,688 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 1519 transitions.
[2024-11-11 16:06:43,688 INFO  L78                 Accepts]: Start accepts. Automaton has 1416 states and 1519 transitions. Word has length 182
[2024-11-11 16:06:43,688 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 16:06:43,689 INFO  L471      AbstractCegarLoop]: Abstraction has 1416 states and 1519 transitions.
[2024-11-11 16:06:43,689 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:06:43,689 INFO  L276                IsEmpty]: Start isEmpty. Operand 1416 states and 1519 transitions.
[2024-11-11 16:06:43,695 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 209
[2024-11-11 16:06:43,696 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 16:06:43,696 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2024-11-11 16:06:43,696 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-11 16:06:43,696 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 16:06:43,700 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 16:06:43,700 INFO  L85        PathProgramCache]: Analyzing trace with hash -282189912, now seen corresponding path program 1 times
[2024-11-11 16:06:43,701 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 16:06:43,701 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800849802]
[2024-11-11 16:06:43,701 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 16:06:43,701 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 16:06:43,759 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 16:06:44,088 INFO  L134       CoverageAnalysis]: Checked inductivity of 126 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked.
[2024-11-11 16:06:44,088 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 16:06:44,088 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800849802]
[2024-11-11 16:06:44,089 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800849802] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 16:06:44,089 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 16:06:44,089 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-11 16:06:44,089 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386582211]
[2024-11-11 16:06:44,089 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 16:06:44,089 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-11 16:06:44,089 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 16:06:44,090 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-11 16:06:44,090 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-11 16:06:44,090 INFO  L87              Difference]: Start difference. First operand 1416 states and 1519 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)
[2024-11-11 16:06:44,518 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 16:06:44,518 INFO  L93              Difference]: Finished difference Result 2774 states and 2994 transitions.
[2024-11-11 16:06:44,519 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-11 16:06:44,519 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 208
[2024-11-11 16:06:44,519 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 16:06:44,522 INFO  L225             Difference]: With dead ends: 2774
[2024-11-11 16:06:44,523 INFO  L226             Difference]: Without dead ends: 1416
[2024-11-11 16:06:44,524 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
[2024-11-11 16:06:44,524 INFO  L435           NwaCegarLoop]: 21 mSDtfsCounter, 118 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-11 16:06:44,525 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 32 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-11 16:06:44,526 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1416 states.
[2024-11-11 16:06:44,536 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1416.
[2024-11-11 16:06:44,538 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1416 states, 1415 states have (on average 1.0706713780918728) internal successors, (1515), 1415 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:06:44,540 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 1515 transitions.
[2024-11-11 16:06:44,540 INFO  L78                 Accepts]: Start accepts. Automaton has 1416 states and 1515 transitions. Word has length 208
[2024-11-11 16:06:44,540 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 16:06:44,540 INFO  L471      AbstractCegarLoop]: Abstraction has 1416 states and 1515 transitions.
[2024-11-11 16:06:44,541 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)
[2024-11-11 16:06:44,541 INFO  L276                IsEmpty]: Start isEmpty. Operand 1416 states and 1515 transitions.
[2024-11-11 16:06:44,543 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 230
[2024-11-11 16:06:44,543 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 16:06:44,543 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-11 16:06:44,543 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-11 16:06:44,543 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 16:06:44,544 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 16:06:44,544 INFO  L85        PathProgramCache]: Analyzing trace with hash -993754207, now seen corresponding path program 1 times
[2024-11-11 16:06:44,544 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 16:06:44,544 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053719921]
[2024-11-11 16:06:44,544 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 16:06:44,544 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 16:06:44,573 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 16:06:44,669 INFO  L134       CoverageAnalysis]: Checked inductivity of 202 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked.
[2024-11-11 16:06:44,669 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 16:06:44,669 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053719921]
[2024-11-11 16:06:44,669 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053719921] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 16:06:44,670 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 16:06:44,670 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-11 16:06:44,670 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030685934]
[2024-11-11 16:06:44,670 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 16:06:44,670 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 16:06:44,670 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 16:06:44,671 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 16:06:44,671 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 16:06:44,671 INFO  L87              Difference]: Start difference. First operand 1416 states and 1515 transitions. Second operand  has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:06:44,976 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 16:06:44,976 INFO  L93              Difference]: Finished difference Result 2828 states and 3053 transitions.
[2024-11-11 16:06:44,979 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 16:06:44,979 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 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 229
[2024-11-11 16:06:44,979 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 16:06:44,980 INFO  L225             Difference]: With dead ends: 2828
[2024-11-11 16:06:44,980 INFO  L226             Difference]: Without dead ends: 0
[2024-11-11 16:06:44,982 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
[2024-11-11 16:06:44,982 INFO  L435           NwaCegarLoop]: 190 mSDtfsCounter, 78 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-11 16:06:44,983 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 204 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-11 16:06:44,983 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2024-11-11 16:06:44,983 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2024-11-11 16:06:44,983 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)
[2024-11-11 16:06:44,983 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2024-11-11 16:06:44,984 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 229
[2024-11-11 16:06:44,984 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 16:06:44,984 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2024-11-11 16:06:44,984 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:06:44,984 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2024-11-11 16:06:44,984 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2024-11-11 16:06:44,986 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-11 16:06:44,987 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-11 16:06:44,989 INFO  L421         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-11 16:06:44,991 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2024-11-11 16:06:45,145 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2024-11-11 16:06:45,164 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 04:06:45 BoogieIcfgContainer
[2024-11-11 16:06:45,164 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-11 16:06:45,164 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-11 16:06:45,165 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-11-11 16:06:45,165 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-11-11 16:06:45,165 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:06:39" (3/4) ...
[2024-11-11 16:06:45,167 INFO  L142         WitnessPrinter]: Generating witness for correct program
[2024-11-11 16:06:45,182 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges
[2024-11-11 16:06:45,183 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2024-11-11 16:06:45,184 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2024-11-11 16:06:45,184 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2024-11-11 16:06:45,294 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-11 16:06:45,294 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2024-11-11 16:06:45,294 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-11 16:06:45,295 INFO  L158              Benchmark]: Toolchain (without parser) took 7582.81ms. Allocated memory was 251.7MB in the beginning and 371.2MB in the end (delta: 119.5MB). Free memory was 219.7MB in the beginning and 239.6MB in the end (delta: -19.8MB). Peak memory consumption was 98.6MB. Max. memory is 16.1GB.
[2024-11-11 16:06:45,295 INFO  L158              Benchmark]: CDTParser took 0.15ms. Allocated memory is still 125.8MB. Free memory is still 91.9MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-11 16:06:45,295 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 454.68ms. Allocated memory is still 251.7MB. Free memory was 219.5MB in the beginning and 197.7MB in the end (delta: 21.9MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB.
[2024-11-11 16:06:45,296 INFO  L158              Benchmark]: Boogie Procedure Inliner took 84.00ms. Allocated memory is still 251.7MB. Free memory was 197.7MB in the beginning and 192.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-11 16:06:45,296 INFO  L158              Benchmark]: Boogie Preprocessor took 100.47ms. Allocated memory is still 251.7MB. Free memory was 192.4MB in the beginning and 187.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
[2024-11-11 16:06:45,296 INFO  L158              Benchmark]: RCFGBuilder took 968.18ms. Allocated memory is still 251.7MB. Free memory was 187.2MB in the beginning and 189.5MB in the end (delta: -2.3MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB.
[2024-11-11 16:06:45,296 INFO  L158              Benchmark]: TraceAbstraction took 5837.71ms. Allocated memory was 251.7MB in the beginning and 371.2MB in the end (delta: 119.5MB). Free memory was 188.4MB in the beginning and 252.2MB in the end (delta: -63.7MB). Peak memory consumption was 56.9MB. Max. memory is 16.1GB.
[2024-11-11 16:06:45,296 INFO  L158              Benchmark]: Witness Printer took 130.29ms. Allocated memory is still 371.2MB. Free memory was 252.2MB in the beginning and 239.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
[2024-11-11 16:06:45,298 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.15ms. Allocated memory is still 125.8MB. Free memory is still 91.9MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 454.68ms. Allocated memory is still 251.7MB. Free memory was 219.5MB in the beginning and 197.7MB in the end (delta: 21.9MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 84.00ms. Allocated memory is still 251.7MB. Free memory was 197.7MB in the beginning and 192.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 100.47ms. Allocated memory is still 251.7MB. Free memory was 192.4MB in the beginning and 187.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
 * RCFGBuilder took 968.18ms. Allocated memory is still 251.7MB. Free memory was 187.2MB in the beginning and 189.5MB in the end (delta: -2.3MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB.
 * TraceAbstraction took 5837.71ms. Allocated memory was 251.7MB in the beginning and 371.2MB in the end (delta: 119.5MB). Free memory was 188.4MB in the beginning and 252.2MB in the end (delta: -63.7MB). Peak memory consumption was 56.9MB. Max. memory is 16.1GB.
 * Witness Printer took 130.29ms. Allocated memory is still 371.2MB. Free memory was 252.2MB in the beginning and 239.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. 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: 512]: 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, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1051 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1051 mSDsluCounter, 1115 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 118 mSDsCounter, 548 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3032 IncrementalHoareTripleChecker+Invalid, 3580 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 548 mSolverCounterUnsat, 997 mSDtfsCounter, 3032 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1854occurred in iteration=5, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 430 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1451 NumberOfCodeBlocks, 1451 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1442 ConstructedInterpolants, 0 QuantifiedInterpolants, 4063 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 639/639 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
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
  - InvariantResult [Line: 616]: Loop Invariant
    Derived loop invariant: ((((((((((a17 <= 7) && (a28 == 10)) && (a21 == 1)) || (((a21 == 1) && (a17 <= 8)) && (a28 <= 7))) || ((((a21 == 1) && (a17 <= 8)) && (a28 <= 10)) && (a11 != 1))) || ((((a25 == 1) && (a17 <= 8)) && (a19 == 1)) && (a28 <= 7))) || ((a28 == 10) && (a19 == 1))) || (((((a25 == 1) && (a21 == 1)) && (a17 <= 8)) && (a19 == 1)) && (a11 != 1))) || ((((a21 == 1) && (a17 <= 8)) && (a28 <= 10)) && (a19 == 1))) || ((((a25 == 1) && (a17 <= 7)) && (a21 == 1)) && (a28 <= 10)))
RESULT: Ultimate proved your program to be correct!
[2024-11-11 16:06:45,331 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