./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label26.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/Problem16_label26.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 19a3ef648ea6e38f7d276220abc8bcbc6382e3dd9d7763e8b9d5f30e7cff149e
--- Real Ultimate output ---
This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m
[2024-11-11 17:12:50,435 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-11 17:12:50,473 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-11 17:12:50,477 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-11 17:12:50,477 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-11 17:12:50,495 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-11 17:12:50,495 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-11 17:12:50,495 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-11 17:12:50,496 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-11 17:12:50,496 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-11 17:12:50,496 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-11 17:12:50,496 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-11 17:12:50,497 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-11 17:12:50,497 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-11 17:12:50,497 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-11 17:12:50,498 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-11 17:12:50,498 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-11 17:12:50,498 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-11 17:12:50,498 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-11 17:12:50,499 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-11 17:12:50,499 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-11 17:12:50,505 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-11 17:12:50,505 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-11 17:12:50,506 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-11 17:12:50,506 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-11 17:12:50,506 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-11 17:12:50,506 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-11 17:12:50,507 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-11 17:12:50,507 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-11 17:12:50,507 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-11 17:12:50,507 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-11 17:12:50,507 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-11 17:12:50,508 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-11 17:12:50,508 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-11 17:12:50,508 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-11 17:12:50,508 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-11 17:12:50,508 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-11 17:12:50,509 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-11 17:12:50,509 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-11 17:12:50,509 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-11 17:12:50,509 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-11 17:12:50,510 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-11 17:12:50,510 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 -> 19a3ef648ea6e38f7d276220abc8bcbc6382e3dd9d7763e8b9d5f30e7cff149e
[2024-11-11 17:12:50,695 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-11 17:12:50,722 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-11 17:12:50,726 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-11 17:12:50,726 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-11 17:12:50,727 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-11 17:12:50,728 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label26.c
[2024-11-11 17:12:52,078 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-11 17:12:52,371 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-11 17:12:52,372 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label26.c
[2024-11-11 17:12:52,388 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af47ddb76/6b7b439b0bf44f139d353609a2cd70ba/FLAG5f743ce02
[2024-11-11 17:12:52,399 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af47ddb76/6b7b439b0bf44f139d353609a2cd70ba
[2024-11-11 17:12:52,402 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-11 17:12:52,403 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-11 17:12:52,404 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-11 17:12:52,404 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-11 17:12:52,408 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-11 17:12:52,409 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 05:12:52" (1/1) ...
[2024-11-11 17:12:52,409 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c6bf271 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:12:52, skipping insertion in model container
[2024-11-11 17:12:52,410 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 05:12:52" (1/1) ...
[2024-11-11 17:12:52,458 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-11 17:12:52,696 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/Problem16_label26.c[3798,3811]
[2024-11-11 17:12:52,970 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-11 17:12:52,984 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-11 17:12:52,997 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/Problem16_label26.c[3798,3811]
[2024-11-11 17:12:53,178 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-11 17:12:53,194 INFO  L204         MainTranslator]: Completed translation
[2024-11-11 17:12:53,194 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:12:53 WrapperNode
[2024-11-11 17:12:53,195 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-11 17:12:53,195 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-11 17:12:53,196 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-11 17:12:53,196 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-11 17:12:53,201 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:12:53" (1/1) ...
[2024-11-11 17:12:53,230 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:12:53" (1/1) ...
[2024-11-11 17:12:53,322 INFO  L138                Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1770
[2024-11-11 17:12:53,322 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-11 17:12:53,323 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-11 17:12:53,323 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-11 17:12:53,323 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-11 17:12:53,332 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:12:53" (1/1) ...
[2024-11-11 17:12:53,332 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:12:53" (1/1) ...
[2024-11-11 17:12:53,344 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:12:53" (1/1) ...
[2024-11-11 17:12:53,399 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 17:12:53,400 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:12:53" (1/1) ...
[2024-11-11 17:12:53,400 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:12:53" (1/1) ...
[2024-11-11 17:12:53,442 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:12:53" (1/1) ...
[2024-11-11 17:12:53,456 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:12:53" (1/1) ...
[2024-11-11 17:12:53,481 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:12:53" (1/1) ...
[2024-11-11 17:12:53,488 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:12:53" (1/1) ...
[2024-11-11 17:12:53,502 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-11 17:12:53,504 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-11 17:12:53,504 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-11 17:12:53,504 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-11 17:12:53,505 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:12:53" (1/1) ...
[2024-11-11 17:12:53,509 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-11 17:12:53,518 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-11 17:12:53,536 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 17:12:53,546 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 17:12:53,580 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-11 17:12:53,581 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-11 17:12:53,582 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-11 17:12:53,582 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-11 17:12:53,643 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-11 17:12:53,645 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-11 17:12:55,308 INFO  L?                        ?]: Removed 276 outVars from TransFormulas that were not future-live.
[2024-11-11 17:12:55,308 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-11 17:12:55,328 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-11 17:12:55,328 INFO  L316             CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-11 17:12:55,328 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:12:55 BoogieIcfgContainer
[2024-11-11 17:12:55,329 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-11 17:12:55,330 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-11 17:12:55,330 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-11 17:12:55,333 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-11 17:12:55,333 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 05:12:52" (1/3) ...
[2024-11-11 17:12:55,333 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f8336e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 05:12:55, skipping insertion in model container
[2024-11-11 17:12:55,334 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:12:53" (2/3) ...
[2024-11-11 17:12:55,334 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f8336e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 05:12:55, skipping insertion in model container
[2024-11-11 17:12:55,334 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:12:55" (3/3) ...
[2024-11-11 17:12:55,335 INFO  L112   eAbstractionObserver]: Analyzing ICFG Problem16_label26.c
[2024-11-11 17:12:55,347 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-11 17:12:55,347 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-11 17:12:55,408 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-11 17:12:55,414 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;@5c855b13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-11 17:12:55,415 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-11 17:12:55,421 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 396 states, 394 states have (on average 1.8350253807106598) internal successors, (723), 395 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 17:12:55,426 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2024-11-11 17:12:55,426 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 17:12:55,427 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]
[2024-11-11 17:12:55,428 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 17:12:55,434 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 17:12:55,434 INFO  L85        PathProgramCache]: Analyzing trace with hash -596708735, now seen corresponding path program 1 times
[2024-11-11 17:12:55,441 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 17:12:55,441 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74192052]
[2024-11-11 17:12:55,442 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 17:12:55,442 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 17:12:55,543 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 17:12:55,697 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 17:12:55,697 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 17:12:55,697 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74192052]
[2024-11-11 17:12:55,698 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74192052] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 17:12:55,698 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 17:12:55,698 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-11 17:12:55,701 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662751688]
[2024-11-11 17:12:55,702 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 17:12:55,707 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 17:12:55,708 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 17:12:55,725 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 17:12:55,725 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 17:12:55,727 INFO  L87              Difference]: Start difference. First operand  has 396 states, 394 states have (on average 1.8350253807106598) internal successors, (723), 395 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 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 17:12:57,330 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 17:12:57,330 INFO  L93              Difference]: Finished difference Result 1122 states and 2103 transitions.
[2024-11-11 17:12:57,331 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 17:12:57,332 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 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 35
[2024-11-11 17:12:57,333 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 17:12:57,344 INFO  L225             Difference]: With dead ends: 1122
[2024-11-11 17:12:57,344 INFO  L226             Difference]: Without dead ends: 662
[2024-11-11 17:12:57,347 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 17:12:57,349 INFO  L435           NwaCegarLoop]: 246 mSDtfsCounter, 352 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2024-11-11 17:12:57,350 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 254 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2024-11-11 17:12:57,363 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 662 states.
[2024-11-11 17:12:57,397 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662.
[2024-11-11 17:12:57,399 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 662 states, 661 states have (on average 1.518910741301059) internal successors, (1004), 661 states have internal predecessors, (1004), 0 states have call successors, (0), 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 17:12:57,400 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1004 transitions.
[2024-11-11 17:12:57,401 INFO  L78                 Accepts]: Start accepts. Automaton has 662 states and 1004 transitions. Word has length 35
[2024-11-11 17:12:57,401 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 17:12:57,402 INFO  L471      AbstractCegarLoop]: Abstraction has 662 states and 1004 transitions.
[2024-11-11 17:12:57,402 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 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 17:12:57,402 INFO  L276                IsEmpty]: Start isEmpty. Operand 662 states and 1004 transitions.
[2024-11-11 17:12:57,404 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2024-11-11 17:12:57,404 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 17:12:57,404 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:12:57,404 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-11 17:12:57,404 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 17:12:57,405 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 17:12:57,405 INFO  L85        PathProgramCache]: Analyzing trace with hash -160204538, now seen corresponding path program 1 times
[2024-11-11 17:12:57,405 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 17:12:57,405 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172993792]
[2024-11-11 17:12:57,405 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 17:12:57,405 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 17:12:57,458 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 17:12:57,614 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-11 17:12:57,616 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 17:12:57,616 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172993792]
[2024-11-11 17:12:57,616 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172993792] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 17:12:57,617 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 17:12:57,617 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-11 17:12:57,617 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485679083]
[2024-11-11 17:12:57,618 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 17:12:57,619 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 17:12:57,620 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 17:12:57,621 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 17:12:57,622 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 17:12:57,622 INFO  L87              Difference]: Start difference. First operand 662 states and 1004 transitions. Second operand  has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 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 17:12:58,939 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 17:12:58,939 INFO  L93              Difference]: Finished difference Result 1980 states and 3007 transitions.
[2024-11-11 17:12:58,940 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 17:12:58,940 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 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 103
[2024-11-11 17:12:58,940 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 17:12:58,944 INFO  L225             Difference]: With dead ends: 1980
[2024-11-11 17:12:58,944 INFO  L226             Difference]: Without dead ends: 1320
[2024-11-11 17:12:58,945 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 17:12:58,946 INFO  L435           NwaCegarLoop]: 212 mSDtfsCounter, 268 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2024-11-11 17:12:58,946 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 217 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2024-11-11 17:12:58,947 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1320 states.
[2024-11-11 17:12:58,968 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320.
[2024-11-11 17:12:58,969 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1320 states, 1319 states have (on average 1.4556482183472328) internal successors, (1920), 1319 states have internal predecessors, (1920), 0 states have call successors, (0), 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 17:12:58,972 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1920 transitions.
[2024-11-11 17:12:58,972 INFO  L78                 Accepts]: Start accepts. Automaton has 1320 states and 1920 transitions. Word has length 103
[2024-11-11 17:12:58,972 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 17:12:58,972 INFO  L471      AbstractCegarLoop]: Abstraction has 1320 states and 1920 transitions.
[2024-11-11 17:12:58,972 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 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 17:12:58,972 INFO  L276                IsEmpty]: Start isEmpty. Operand 1320 states and 1920 transitions.
[2024-11-11 17:12:58,974 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 115
[2024-11-11 17:12:58,974 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 17:12:58,975 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:12:58,975 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-11 17:12:58,975 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 17:12:58,975 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 17:12:58,975 INFO  L85        PathProgramCache]: Analyzing trace with hash -1741004193, now seen corresponding path program 1 times
[2024-11-11 17:12:58,975 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 17:12:58,976 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315907852]
[2024-11-11 17:12:58,976 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 17:12:58,976 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 17:12:58,999 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 17:12:59,062 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-11 17:12:59,062 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 17:12:59,062 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315907852]
[2024-11-11 17:12:59,062 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315907852] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 17:12:59,063 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 17:12:59,063 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-11 17:12:59,063 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027175524]
[2024-11-11 17:12:59,063 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 17:12:59,063 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 17:12:59,063 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 17:12:59,064 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 17:12:59,064 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 17:12:59,064 INFO  L87              Difference]: Start difference. First operand 1320 states and 1920 transitions. Second operand  has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 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 17:13:00,135 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 17:13:00,135 INFO  L93              Difference]: Finished difference Result 3954 states and 5755 transitions.
[2024-11-11 17:13:00,136 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 17:13:00,136 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 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 114
[2024-11-11 17:13:00,136 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 17:13:00,143 INFO  L225             Difference]: With dead ends: 3954
[2024-11-11 17:13:00,143 INFO  L226             Difference]: Without dead ends: 2636
[2024-11-11 17:13:00,145 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 17:13:00,146 INFO  L435           NwaCegarLoop]: 151 mSDtfsCounter, 369 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2024-11-11 17:13:00,146 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 155 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2024-11-11 17:13:00,148 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2636 states.
[2024-11-11 17:13:00,170 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2636.
[2024-11-11 17:13:00,172 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2636 states, 2635 states have (on average 1.3240986717267553) internal successors, (3489), 2635 states have internal predecessors, (3489), 0 states have call successors, (0), 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 17:13:00,177 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 3489 transitions.
[2024-11-11 17:13:00,177 INFO  L78                 Accepts]: Start accepts. Automaton has 2636 states and 3489 transitions. Word has length 114
[2024-11-11 17:13:00,177 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 17:13:00,178 INFO  L471      AbstractCegarLoop]: Abstraction has 2636 states and 3489 transitions.
[2024-11-11 17:13:00,178 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 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 17:13:00,178 INFO  L276                IsEmpty]: Start isEmpty. Operand 2636 states and 3489 transitions.
[2024-11-11 17:13:00,184 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 233
[2024-11-11 17:13:00,184 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 17:13:00,184 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-11 17:13:00,185 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-11 17:13:00,185 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 17:13:00,185 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 17:13:00,185 INFO  L85        PathProgramCache]: Analyzing trace with hash 2737761, now seen corresponding path program 1 times
[2024-11-11 17:13:00,185 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 17:13:00,186 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95230195]
[2024-11-11 17:13:00,186 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 17:13:00,186 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 17:13:00,216 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 17:13:00,335 INFO  L134       CoverageAnalysis]: Checked inductivity of 130 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked.
[2024-11-11 17:13:00,335 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 17:13:00,335 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95230195]
[2024-11-11 17:13:00,335 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95230195] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 17:13:00,336 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 17:13:00,336 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-11 17:13:00,336 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243012338]
[2024-11-11 17:13:00,336 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 17:13:00,336 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 17:13:00,337 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 17:13:00,337 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 17:13:00,337 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 17:13:00,337 INFO  L87              Difference]: Start difference. First operand 2636 states and 3489 transitions. Second operand  has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 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 17:13:01,368 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 17:13:01,369 INFO  L93              Difference]: Finished difference Result 6586 states and 8545 transitions.
[2024-11-11 17:13:01,369 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 17:13:01,369 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 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 232
[2024-11-11 17:13:01,370 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 17:13:01,380 INFO  L225             Difference]: With dead ends: 6586
[2024-11-11 17:13:01,380 INFO  L226             Difference]: Without dead ends: 3952
[2024-11-11 17:13:01,384 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 17:13:01,385 INFO  L435           NwaCegarLoop]: 80 mSDtfsCounter, 277 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2024-11-11 17:13:01,386 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 84 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2024-11-11 17:13:01,388 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3952 states.
[2024-11-11 17:13:01,429 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 3952.
[2024-11-11 17:13:01,433 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3952 states, 3951 states have (on average 1.216400911161731) internal successors, (4806), 3951 states have internal predecessors, (4806), 0 states have call successors, (0), 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 17:13:01,439 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 4806 transitions.
[2024-11-11 17:13:01,439 INFO  L78                 Accepts]: Start accepts. Automaton has 3952 states and 4806 transitions. Word has length 232
[2024-11-11 17:13:01,440 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 17:13:01,440 INFO  L471      AbstractCegarLoop]: Abstraction has 3952 states and 4806 transitions.
[2024-11-11 17:13:01,440 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 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 17:13:01,440 INFO  L276                IsEmpty]: Start isEmpty. Operand 3952 states and 4806 transitions.
[2024-11-11 17:13:01,443 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 281
[2024-11-11 17:13:01,443 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 17:13:01,443 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:13:01,443 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-11 17:13:01,443 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 17:13:01,444 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 17:13:01,444 INFO  L85        PathProgramCache]: Analyzing trace with hash -550188002, now seen corresponding path program 1 times
[2024-11-11 17:13:01,444 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 17:13:01,444 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656127557]
[2024-11-11 17:13:01,445 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 17:13:01,445 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 17:13:01,488 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 17:13:01,861 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-11 17:13:01,862 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 17:13:01,862 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656127557]
[2024-11-11 17:13:01,862 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656127557] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 17:13:01,862 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 17:13:01,862 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-11 17:13:01,862 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216597390]
[2024-11-11 17:13:01,862 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 17:13:01,863 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-11 17:13:01,863 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 17:13:01,864 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-11 17:13:01,864 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-11 17:13:01,864 INFO  L87              Difference]: Start difference. First operand 3952 states and 4806 transitions. Second operand  has 4 states, 4 states have (on average 70.0) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 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 17:13:02,938 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 17:13:02,939 INFO  L93              Difference]: Finished difference Result 8231 states and 9951 transitions.
[2024-11-11 17:13:02,939 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-11 17:13:02,939 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 70.0) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 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 280
[2024-11-11 17:13:02,940 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 17:13:02,951 INFO  L225             Difference]: With dead ends: 8231
[2024-11-11 17:13:02,952 INFO  L226             Difference]: Without dead ends: 4281
[2024-11-11 17:13:02,956 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-11 17:13:02,959 INFO  L435           NwaCegarLoop]: 267 mSDtfsCounter, 127 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1469 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2024-11-11 17:13:02,960 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 322 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1469 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2024-11-11 17:13:02,964 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4281 states.
[2024-11-11 17:13:03,003 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4281 to 4281.
[2024-11-11 17:13:03,010 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4281 states, 4280 states have (on average 1.2011682242990653) internal successors, (5141), 4280 states have internal predecessors, (5141), 0 states have call successors, (0), 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 17:13:03,016 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4281 states to 4281 states and 5141 transitions.
[2024-11-11 17:13:03,017 INFO  L78                 Accepts]: Start accepts. Automaton has 4281 states and 5141 transitions. Word has length 280
[2024-11-11 17:13:03,018 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 17:13:03,018 INFO  L471      AbstractCegarLoop]: Abstraction has 4281 states and 5141 transitions.
[2024-11-11 17:13:03,018 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 70.0) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 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 17:13:03,018 INFO  L276                IsEmpty]: Start isEmpty. Operand 4281 states and 5141 transitions.
[2024-11-11 17:13:03,022 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 368
[2024-11-11 17:13:03,022 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 17:13:03,022 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-11 17:13:03,023 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-11 17:13:03,023 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 17:13:03,023 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 17:13:03,024 INFO  L85        PathProgramCache]: Analyzing trace with hash -1774097940, now seen corresponding path program 1 times
[2024-11-11 17:13:03,024 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 17:13:03,024 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111487584]
[2024-11-11 17:13:03,025 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 17:13:03,025 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 17:13:03,077 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 17:13:03,519 INFO  L134       CoverageAnalysis]: Checked inductivity of 151 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-11 17:13:03,519 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 17:13:03,519 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111487584]
[2024-11-11 17:13:03,519 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111487584] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 17:13:03,519 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 17:13:03,519 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-11 17:13:03,519 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170910140]
[2024-11-11 17:13:03,520 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 17:13:03,520 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-11 17:13:03,520 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 17:13:03,521 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-11 17:13:03,521 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2024-11-11 17:13:03,521 INFO  L87              Difference]: Start difference. First operand 4281 states and 5141 transitions. Second operand  has 7 states, 7 states have (on average 52.42857142857143) internal successors, (367), 6 states have internal predecessors, (367), 0 states have call successors, (0), 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 17:13:05,027 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 17:13:05,028 INFO  L93              Difference]: Finished difference Result 8090 states and 9792 transitions.
[2024-11-11 17:13:05,028 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-11-11 17:13:05,028 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 52.42857142857143) internal successors, (367), 6 states have internal predecessors, (367), 0 states have call successors, (0), 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 367
[2024-11-11 17:13:05,029 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 17:13:05,045 INFO  L225             Difference]: With dead ends: 8090
[2024-11-11 17:13:05,049 INFO  L226             Difference]: Without dead ends: 3952
[2024-11-11 17:13:05,053 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2024-11-11 17:13:05,057 INFO  L435           NwaCegarLoop]: 263 mSDtfsCounter, 315 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 1795 mSolverCounterSat, 645 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 2440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 645 IncrementalHoareTripleChecker+Valid, 1795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2024-11-11 17:13:05,058 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 288 Invalid, 2440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [645 Valid, 1795 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2024-11-11 17:13:05,061 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3952 states.
[2024-11-11 17:13:05,097 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 3952.
[2024-11-11 17:13:05,101 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3952 states, 3951 states have (on average 1.0802328524424196) internal successors, (4268), 3951 states have internal predecessors, (4268), 0 states have call successors, (0), 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 17:13:05,106 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 4268 transitions.
[2024-11-11 17:13:05,109 INFO  L78                 Accepts]: Start accepts. Automaton has 3952 states and 4268 transitions. Word has length 367
[2024-11-11 17:13:05,109 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 17:13:05,109 INFO  L471      AbstractCegarLoop]: Abstraction has 3952 states and 4268 transitions.
[2024-11-11 17:13:05,109 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 52.42857142857143) internal successors, (367), 6 states have internal predecessors, (367), 0 states have call successors, (0), 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 17:13:05,109 INFO  L276                IsEmpty]: Start isEmpty. Operand 3952 states and 4268 transitions.
[2024-11-11 17:13:05,112 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 375
[2024-11-11 17:13:05,113 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 17:13:05,114 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-11 17:13:05,114 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-11 17:13:05,114 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 17:13:05,114 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 17:13:05,115 INFO  L85        PathProgramCache]: Analyzing trace with hash 799876612, now seen corresponding path program 1 times
[2024-11-11 17:13:05,115 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 17:13:05,115 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049881717]
[2024-11-11 17:13:05,115 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 17:13:05,115 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 17:13:05,181 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 17:13:05,356 INFO  L134       CoverageAnalysis]: Checked inductivity of 160 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked.
[2024-11-11 17:13:05,356 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 17:13:05,356 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049881717]
[2024-11-11 17:13:05,356 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049881717] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 17:13:05,357 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 17:13:05,357 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-11 17:13:05,357 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548582030]
[2024-11-11 17:13:05,357 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 17:13:05,357 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 17:13:05,358 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 17:13:05,358 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 17:13:05,358 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 17:13:05,359 INFO  L87              Difference]: Start difference. First operand 3952 states and 4268 transitions. Second operand  has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 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 17:13:06,187 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 17:13:06,188 INFO  L93              Difference]: Finished difference Result 9218 states and 10060 transitions.
[2024-11-11 17:13:06,188 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 17:13:06,189 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 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 374
[2024-11-11 17:13:06,189 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 17:13:06,202 INFO  L225             Difference]: With dead ends: 9218
[2024-11-11 17:13:06,203 INFO  L226             Difference]: Without dead ends: 5597
[2024-11-11 17:13:06,206 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 17:13:06,208 INFO  L435           NwaCegarLoop]: 400 mSDtfsCounter, 300 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2024-11-11 17:13:06,209 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 406 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2024-11-11 17:13:06,212 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5597 states.
[2024-11-11 17:13:06,270 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5597 to 5597.
[2024-11-11 17:13:06,276 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5597 states, 5596 states have (on average 1.0748749106504647) internal successors, (6015), 5596 states have internal predecessors, (6015), 0 states have call successors, (0), 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 17:13:06,287 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5597 states to 5597 states and 6015 transitions.
[2024-11-11 17:13:06,289 INFO  L78                 Accepts]: Start accepts. Automaton has 5597 states and 6015 transitions. Word has length 374
[2024-11-11 17:13:06,290 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 17:13:06,290 INFO  L471      AbstractCegarLoop]: Abstraction has 5597 states and 6015 transitions.
[2024-11-11 17:13:06,290 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 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 17:13:06,290 INFO  L276                IsEmpty]: Start isEmpty. Operand 5597 states and 6015 transitions.
[2024-11-11 17:13:06,295 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 430
[2024-11-11 17:13:06,295 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 17:13:06,296 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-11 17:13:06,296 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-11 17:13:06,296 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 17:13:06,296 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 17:13:06,296 INFO  L85        PathProgramCache]: Analyzing trace with hash 1213919491, now seen corresponding path program 1 times
[2024-11-11 17:13:06,297 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 17:13:06,297 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598766366]
[2024-11-11 17:13:06,297 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 17:13:06,297 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 17:13:06,377 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 17:13:06,575 INFO  L134       CoverageAnalysis]: Checked inductivity of 223 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-11 17:13:06,576 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 17:13:06,576 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598766366]
[2024-11-11 17:13:06,576 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598766366] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 17:13:06,576 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 17:13:06,576 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-11 17:13:06,576 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081022934]
[2024-11-11 17:13:06,577 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 17:13:06,578 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 17:13:06,578 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 17:13:06,578 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 17:13:06,578 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 17:13:06,579 INFO  L87              Difference]: Start difference. First operand 5597 states and 6015 transitions. Second operand  has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 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 17:13:07,374 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 17:13:07,375 INFO  L93              Difference]: Finished difference Result 10863 states and 11697 transitions.
[2024-11-11 17:13:07,375 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 17:13:07,375 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 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 429
[2024-11-11 17:13:07,376 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 17:13:07,403 INFO  L225             Difference]: With dead ends: 10863
[2024-11-11 17:13:07,403 INFO  L226             Difference]: Without dead ends: 5597
[2024-11-11 17:13:07,414 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 17:13:07,417 INFO  L435           NwaCegarLoop]: 412 mSDtfsCounter, 178 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2024-11-11 17:13:07,418 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 417 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2024-11-11 17:13:07,427 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5597 states.
[2024-11-11 17:13:07,553 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5597 to 5597.
[2024-11-11 17:13:07,572 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5597 states, 5596 states have (on average 1.0491422444603289) internal successors, (5871), 5596 states have internal predecessors, (5871), 0 states have call successors, (0), 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 17:13:07,578 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5597 states to 5597 states and 5871 transitions.
[2024-11-11 17:13:07,578 INFO  L78                 Accepts]: Start accepts. Automaton has 5597 states and 5871 transitions. Word has length 429
[2024-11-11 17:13:07,579 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 17:13:07,579 INFO  L471      AbstractCegarLoop]: Abstraction has 5597 states and 5871 transitions.
[2024-11-11 17:13:07,579 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 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 17:13:07,579 INFO  L276                IsEmpty]: Start isEmpty. Operand 5597 states and 5871 transitions.
[2024-11-11 17:13:07,584 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 514
[2024-11-11 17:13:07,584 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 17:13:07,584 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2024-11-11 17:13:07,584 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-11 17:13:07,584 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 17:13:07,585 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 17:13:07,585 INFO  L85        PathProgramCache]: Analyzing trace with hash 1986410989, now seen corresponding path program 1 times
[2024-11-11 17:13:07,585 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 17:13:07,585 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146822320]
[2024-11-11 17:13:07,585 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 17:13:07,586 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 17:13:07,648 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 17:13:07,919 INFO  L134       CoverageAnalysis]: Checked inductivity of 299 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-11 17:13:07,919 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 17:13:07,920 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146822320]
[2024-11-11 17:13:07,920 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146822320] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 17:13:07,920 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 17:13:07,920 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-11 17:13:07,920 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263557363]
[2024-11-11 17:13:07,920 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 17:13:07,921 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-11 17:13:07,921 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 17:13:07,922 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-11 17:13:07,922 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-11 17:13:07,922 INFO  L87              Difference]: Start difference. First operand 5597 states and 5871 transitions. Second operand  has 4 states, 4 states have (on average 128.25) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 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 17:13:09,186 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 17:13:09,186 INFO  L93              Difference]: Finished difference Result 16456 states and 17283 transitions.
[2024-11-11 17:13:09,186 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-11 17:13:09,187 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 128.25) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 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 513
[2024-11-11 17:13:09,188 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 17:13:09,203 INFO  L225             Difference]: With dead ends: 16456
[2024-11-11 17:13:09,203 INFO  L226             Difference]: Without dead ends: 11190
[2024-11-11 17:13:09,207 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 17:13:09,208 INFO  L435           NwaCegarLoop]: 89 mSDtfsCounter, 192 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1620 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 1733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2024-11-11 17:13:09,208 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 98 Invalid, 1733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1620 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2024-11-11 17:13:09,215 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11190 states.
[2024-11-11 17:13:09,278 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11190 to 9216.
[2024-11-11 17:13:09,291 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9216 states, 9215 states have (on average 1.0493760173629951) internal successors, (9670), 9215 states have internal predecessors, (9670), 0 states have call successors, (0), 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 17:13:09,300 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9216 states to 9216 states and 9670 transitions.
[2024-11-11 17:13:09,301 INFO  L78                 Accepts]: Start accepts. Automaton has 9216 states and 9670 transitions. Word has length 513
[2024-11-11 17:13:09,301 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 17:13:09,301 INFO  L471      AbstractCegarLoop]: Abstraction has 9216 states and 9670 transitions.
[2024-11-11 17:13:09,302 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 128.25) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 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 17:13:09,303 INFO  L276                IsEmpty]: Start isEmpty. Operand 9216 states and 9670 transitions.
[2024-11-11 17:13:09,308 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 534
[2024-11-11 17:13:09,308 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 17:13:09,308 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:13:09,308 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-11 17:13:09,308 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 17:13:09,309 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 17:13:09,309 INFO  L85        PathProgramCache]: Analyzing trace with hash 1297278532, now seen corresponding path program 1 times
[2024-11-11 17:13:09,309 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 17:13:09,309 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195602923]
[2024-11-11 17:13:09,309 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 17:13:09,309 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 17:13:09,373 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 17:13:09,543 INFO  L134       CoverageAnalysis]: Checked inductivity of 447 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked.
[2024-11-11 17:13:09,543 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 17:13:09,543 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195602923]
[2024-11-11 17:13:09,543 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195602923] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 17:13:09,543 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 17:13:09,543 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-11 17:13:09,543 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015199521]
[2024-11-11 17:13:09,544 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 17:13:09,544 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 17:13:09,544 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 17:13:09,545 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 17:13:09,546 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 17:13:09,546 INFO  L87              Difference]: Start difference. First operand 9216 states and 9670 transitions. Second operand  has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 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 17:13:10,470 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 17:13:10,470 INFO  L93              Difference]: Finished difference Result 21062 states and 22144 transitions.
[2024-11-11 17:13:10,470 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 17:13:10,471 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 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 533
[2024-11-11 17:13:10,471 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 17:13:10,485 INFO  L225             Difference]: With dead ends: 21062
[2024-11-11 17:13:10,485 INFO  L226             Difference]: Without dead ends: 12177
[2024-11-11 17:13:10,493 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 17:13:10,493 INFO  L435           NwaCegarLoop]: 34 mSDtfsCounter, 190 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2024-11-11 17:13:10,494 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 38 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2024-11-11 17:13:10,500 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12177 states.
[2024-11-11 17:13:10,573 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12177 to 11519.
[2024-11-11 17:13:10,581 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11519 states, 11518 states have (on average 1.0467963188053482) internal successors, (12057), 11518 states have internal predecessors, (12057), 0 states have call successors, (0), 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 17:13:10,591 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11519 states to 11519 states and 12057 transitions.
[2024-11-11 17:13:10,591 INFO  L78                 Accepts]: Start accepts. Automaton has 11519 states and 12057 transitions. Word has length 533
[2024-11-11 17:13:10,592 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 17:13:10,592 INFO  L471      AbstractCegarLoop]: Abstraction has 11519 states and 12057 transitions.
[2024-11-11 17:13:10,592 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 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 17:13:10,592 INFO  L276                IsEmpty]: Start isEmpty. Operand 11519 states and 12057 transitions.
[2024-11-11 17:13:10,599 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 588
[2024-11-11 17:13:10,599 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 17:13:10,600 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:13:10,600 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-11 17:13:10,601 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 17:13:10,601 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 17:13:10,601 INFO  L85        PathProgramCache]: Analyzing trace with hash -1351696355, now seen corresponding path program 1 times
[2024-11-11 17:13:10,601 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 17:13:10,601 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351850749]
[2024-11-11 17:13:10,601 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 17:13:10,602 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 17:13:10,655 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 17:13:11,310 INFO  L134       CoverageAnalysis]: Checked inductivity of 571 backedges. 538 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked.
[2024-11-11 17:13:11,311 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 17:13:11,311 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351850749]
[2024-11-11 17:13:11,311 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351850749] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 17:13:11,311 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 17:13:11,311 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-11 17:13:11,311 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127336842]
[2024-11-11 17:13:11,311 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 17:13:11,312 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-11 17:13:11,312 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 17:13:11,312 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-11 17:13:11,313 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-11 17:13:11,313 INFO  L87              Difference]: Start difference. First operand 11519 states and 12057 transitions. Second operand  has 4 states, 4 states have (on average 138.75) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 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 17:13:11,984 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 17:13:11,984 INFO  L93              Difference]: Finished difference Result 23036 states and 24115 transitions.
[2024-11-11 17:13:11,984 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 17:13:11,985 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 138.75) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 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 587
[2024-11-11 17:13:11,985 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 17:13:11,999 INFO  L225             Difference]: With dead ends: 23036
[2024-11-11 17:13:12,000 INFO  L226             Difference]: Without dead ends: 11848
[2024-11-11 17:13:12,008 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 17:13:12,009 INFO  L435           NwaCegarLoop]: 108 mSDtfsCounter, 268 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-11 17:13:12,009 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 113 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-11 17:13:12,016 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11848 states.
[2024-11-11 17:13:12,085 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11848 to 11848.
[2024-11-11 17:13:12,096 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11848 states, 11847 states have (on average 1.0456655693424495) internal successors, (12388), 11847 states have internal predecessors, (12388), 0 states have call successors, (0), 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 17:13:12,107 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11848 states to 11848 states and 12388 transitions.
[2024-11-11 17:13:12,108 INFO  L78                 Accepts]: Start accepts. Automaton has 11848 states and 12388 transitions. Word has length 587
[2024-11-11 17:13:12,108 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 17:13:12,109 INFO  L471      AbstractCegarLoop]: Abstraction has 11848 states and 12388 transitions.
[2024-11-11 17:13:12,109 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 138.75) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 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 17:13:12,109 INFO  L276                IsEmpty]: Start isEmpty. Operand 11848 states and 12388 transitions.
[2024-11-11 17:13:12,113 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 649
[2024-11-11 17:13:12,113 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 17:13:12,114 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-11 17:13:12,114 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-11 17:13:12,114 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 17:13:12,115 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 17:13:12,115 INFO  L85        PathProgramCache]: Analyzing trace with hash 2067726543, now seen corresponding path program 1 times
[2024-11-11 17:13:12,116 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 17:13:12,116 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144891423]
[2024-11-11 17:13:12,116 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 17:13:12,116 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 17:13:12,202 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 17:13:12,639 INFO  L134       CoverageAnalysis]: Checked inductivity of 633 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked.
[2024-11-11 17:13:12,639 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 17:13:12,639 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144891423]
[2024-11-11 17:13:12,639 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144891423] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 17:13:12,640 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 17:13:12,640 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-11 17:13:12,640 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575912903]
[2024-11-11 17:13:12,640 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 17:13:12,641 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 17:13:12,641 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 17:13:12,642 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 17:13:12,642 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 17:13:12,643 INFO  L87              Difference]: Start difference. First operand 11848 states and 12388 transitions. Second operand  has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 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 17:13:13,324 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 17:13:13,325 INFO  L93              Difference]: Finished difference Result 23036 states and 24112 transitions.
[2024-11-11 17:13:13,325 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 17:13:13,328 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 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 648
[2024-11-11 17:13:13,329 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 17:13:13,349 INFO  L225             Difference]: With dead ends: 23036
[2024-11-11 17:13:13,349 INFO  L226             Difference]: Without dead ends: 11848
[2024-11-11 17:13:13,358 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 17:13:13,359 INFO  L435           NwaCegarLoop]: 421 mSDtfsCounter, 312 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-11 17:13:13,359 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 427 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-11 17:13:13,364 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11848 states.
[2024-11-11 17:13:13,420 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11848 to 10861.
[2024-11-11 17:13:13,426 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10861 states, 10860 states have (on average 1.0427255985267034) internal successors, (11324), 10860 states have internal predecessors, (11324), 0 states have call successors, (0), 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 17:13:13,433 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10861 states to 10861 states and 11324 transitions.
[2024-11-11 17:13:13,433 INFO  L78                 Accepts]: Start accepts. Automaton has 10861 states and 11324 transitions. Word has length 648
[2024-11-11 17:13:13,434 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 17:13:13,434 INFO  L471      AbstractCegarLoop]: Abstraction has 10861 states and 11324 transitions.
[2024-11-11 17:13:13,434 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 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 17:13:13,434 INFO  L276                IsEmpty]: Start isEmpty. Operand 10861 states and 11324 transitions.
[2024-11-11 17:13:13,441 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 838
[2024-11-11 17:13:13,441 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 17:13:13,441 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-11 17:13:13,442 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-11-11 17:13:13,442 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 17:13:13,442 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 17:13:13,442 INFO  L85        PathProgramCache]: Analyzing trace with hash -1580164344, now seen corresponding path program 1 times
[2024-11-11 17:13:13,443 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 17:13:13,443 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590135911]
[2024-11-11 17:13:13,443 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 17:13:13,443 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 17:13:13,523 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 17:13:13,858 INFO  L134       CoverageAnalysis]: Checked inductivity of 1271 backedges. 865 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked.
[2024-11-11 17:13:13,859 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 17:13:13,859 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590135911]
[2024-11-11 17:13:13,859 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590135911] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 17:13:13,859 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 17:13:13,859 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-11 17:13:13,859 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118039495]
[2024-11-11 17:13:13,859 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 17:13:13,860 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 17:13:13,860 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 17:13:13,861 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 17:13:13,861 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 17:13:13,861 INFO  L87              Difference]: Start difference. First operand 10861 states and 11324 transitions. Second operand  has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 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 17:13:14,550 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 17:13:14,550 INFO  L93              Difference]: Finished difference Result 24023 states and 25131 transitions.
[2024-11-11 17:13:14,551 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 17:13:14,551 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 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 837
[2024-11-11 17:13:14,552 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 17:13:14,565 INFO  L225             Difference]: With dead ends: 24023
[2024-11-11 17:13:14,565 INFO  L226             Difference]: Without dead ends: 13822
[2024-11-11 17:13:14,573 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 17:13:14,574 INFO  L435           NwaCegarLoop]: 437 mSDtfsCounter, 192 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-11 17:13:14,574 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 443 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-11 17:13:14,580 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13822 states.
[2024-11-11 17:13:14,651 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13822 to 13164.
[2024-11-11 17:13:14,658 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13164 states, 13163 states have (on average 1.041555876319988) internal successors, (13710), 13163 states have internal predecessors, (13710), 0 states have call successors, (0), 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 17:13:14,668 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 13710 transitions.
[2024-11-11 17:13:14,669 INFO  L78                 Accepts]: Start accepts. Automaton has 13164 states and 13710 transitions. Word has length 837
[2024-11-11 17:13:14,669 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 17:13:14,669 INFO  L471      AbstractCegarLoop]: Abstraction has 13164 states and 13710 transitions.
[2024-11-11 17:13:14,670 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 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 17:13:14,670 INFO  L276                IsEmpty]: Start isEmpty. Operand 13164 states and 13710 transitions.
[2024-11-11 17:13:14,677 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 847
[2024-11-11 17:13:14,677 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 17:13:14,678 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-11 17:13:14,678 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-11-11 17:13:14,678 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 17:13:14,678 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 17:13:14,679 INFO  L85        PathProgramCache]: Analyzing trace with hash -1022116617, now seen corresponding path program 1 times
[2024-11-11 17:13:14,679 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 17:13:14,679 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335425485]
[2024-11-11 17:13:14,679 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 17:13:14,679 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 17:13:14,804 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 17:13:15,765 INFO  L134       CoverageAnalysis]: Checked inductivity of 1054 backedges. 99 proven. 580 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked.
[2024-11-11 17:13:15,765 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 17:13:15,765 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335425485]
[2024-11-11 17:13:15,765 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335425485] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-11 17:13:15,766 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740635804]
[2024-11-11 17:13:15,766 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 17:13:15,766 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-11 17:13:15,766 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-11 17:13:15,768 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-11 17:13:15,769 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-11 17:13:16,003 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 17:13:16,007 INFO  L256         TraceCheckSpWp]: Trace formula consists of 983 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-11 17:13:16,040 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2024-11-11 17:13:16,157 INFO  L134       CoverageAnalysis]: Checked inductivity of 1054 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 923 trivial. 0 not checked.
[2024-11-11 17:13:16,157 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-11 17:13:16,157 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740635804] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 17:13:16,158 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-11 17:13:16,158 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6
[2024-11-11 17:13:16,158 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086067697]
[2024-11-11 17:13:16,158 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 17:13:16,158 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 17:13:16,158 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 17:13:16,159 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 17:13:16,159 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-11 17:13:16,159 INFO  L87              Difference]: Start difference. First operand 13164 states and 13710 transitions. Second operand  has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 17:13:16,892 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 17:13:16,893 INFO  L93              Difference]: Finished difference Result 30603 states and 31962 transitions.
[2024-11-11 17:13:16,893 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 17:13:16,893 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 846
[2024-11-11 17:13:16,894 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 17:13:16,906 INFO  L225             Difference]: With dead ends: 30603
[2024-11-11 17:13:16,906 INFO  L226             Difference]: Without dead ends: 16454
[2024-11-11 17:13:16,915 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 850 GetRequests, 846 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-11 17:13:16,916 INFO  L435           NwaCegarLoop]: 424 mSDtfsCounter, 304 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2024-11-11 17:13:16,916 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 430 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2024-11-11 17:13:16,925 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 16454 states.
[2024-11-11 17:13:17,082 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 16454 to 16125.
[2024-11-11 17:13:17,092 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 16125 states, 16124 states have (on average 1.0328702555197222) internal successors, (16654), 16124 states have internal predecessors, (16654), 0 states have call successors, (0), 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 17:13:17,104 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16125 states to 16125 states and 16654 transitions.
[2024-11-11 17:13:17,105 INFO  L78                 Accepts]: Start accepts. Automaton has 16125 states and 16654 transitions. Word has length 846
[2024-11-11 17:13:17,105 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 17:13:17,106 INFO  L471      AbstractCegarLoop]: Abstraction has 16125 states and 16654 transitions.
[2024-11-11 17:13:17,106 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 17:13:17,106 INFO  L276                IsEmpty]: Start isEmpty. Operand 16125 states and 16654 transitions.
[2024-11-11 17:13:17,118 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1063
[2024-11-11 17:13:17,118 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 17:13:17,119 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:13:17,136 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-11-11 17:13:17,319 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2024-11-11 17:13:17,320 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 17:13:17,321 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 17:13:17,321 INFO  L85        PathProgramCache]: Analyzing trace with hash -605319891, now seen corresponding path program 1 times
[2024-11-11 17:13:17,321 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 17:13:17,321 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765426456]
[2024-11-11 17:13:17,322 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 17:13:17,322 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 17:13:17,434 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 17:13:18,409 INFO  L134       CoverageAnalysis]: Checked inductivity of 1780 backedges. 660 proven. 784 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked.
[2024-11-11 17:13:18,409 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 17:13:18,409 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765426456]
[2024-11-11 17:13:18,409 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765426456] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-11 17:13:18,410 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006556727]
[2024-11-11 17:13:18,410 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 17:13:18,410 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-11 17:13:18,410 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-11 17:13:18,415 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-11 17:13:18,416 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-11 17:13:18,703 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 17:13:18,706 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1224 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-11 17:13:18,714 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2024-11-11 17:13:19,155 INFO  L134       CoverageAnalysis]: Checked inductivity of 1780 backedges. 1012 proven. 0 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked.
[2024-11-11 17:13:19,156 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-11 17:13:19,156 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006556727] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 17:13:19,156 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-11 17:13:19,156 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6
[2024-11-11 17:13:19,156 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711597002]
[2024-11-11 17:13:19,156 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 17:13:19,157 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 17:13:19,157 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 17:13:19,158 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 17:13:19,158 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-11 17:13:19,158 INFO  L87              Difference]: Start difference. First operand 16125 states and 16654 transitions. Second operand  has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 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 17:13:19,874 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 17:13:19,875 INFO  L93              Difference]: Finished difference Result 31590 states and 32644 transitions.
[2024-11-11 17:13:19,875 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 17:13:19,875 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 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 1062
[2024-11-11 17:13:19,876 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 17:13:19,887 INFO  L225             Difference]: With dead ends: 31590
[2024-11-11 17:13:19,887 INFO  L226             Difference]: Without dead ends: 16125
[2024-11-11 17:13:19,893 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1066 GetRequests, 1062 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-11 17:13:19,894 INFO  L435           NwaCegarLoop]: 371 mSDtfsCounter, 94 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-11 17:13:19,894 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 377 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-11 17:13:19,902 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 16125 states.
[2024-11-11 17:13:19,987 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 16125 to 16125.
[2024-11-11 17:13:19,998 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 16125 states, 16124 states have (on average 1.0286529397171917) internal successors, (16586), 16124 states have internal predecessors, (16586), 0 states have call successors, (0), 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 17:13:20,013 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16125 states to 16125 states and 16586 transitions.
[2024-11-11 17:13:20,014 INFO  L78                 Accepts]: Start accepts. Automaton has 16125 states and 16586 transitions. Word has length 1062
[2024-11-11 17:13:20,014 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 17:13:20,015 INFO  L471      AbstractCegarLoop]: Abstraction has 16125 states and 16586 transitions.
[2024-11-11 17:13:20,015 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 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 17:13:20,015 INFO  L276                IsEmpty]: Start isEmpty. Operand 16125 states and 16586 transitions.
[2024-11-11 17:13:20,034 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1120
[2024-11-11 17:13:20,034 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 17:13:20,035 INFO  L218           NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-11 17:13:20,052 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2024-11-11 17:13:20,235 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14
[2024-11-11 17:13:20,236 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 17:13:20,237 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 17:13:20,237 INFO  L85        PathProgramCache]: Analyzing trace with hash 1791227076, now seen corresponding path program 1 times
[2024-11-11 17:13:20,237 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 17:13:20,237 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335740419]
[2024-11-11 17:13:20,237 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 17:13:20,237 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 17:13:20,368 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 17:13:20,743 INFO  L134       CoverageAnalysis]: Checked inductivity of 2442 backedges. 1730 proven. 0 refuted. 0 times theorem prover too weak. 712 trivial. 0 not checked.
[2024-11-11 17:13:20,743 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 17:13:20,743 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335740419]
[2024-11-11 17:13:20,743 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335740419] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 17:13:20,743 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 17:13:20,743 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-11 17:13:20,744 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129200917]
[2024-11-11 17:13:20,744 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 17:13:20,744 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 17:13:20,745 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 17:13:20,745 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 17:13:20,745 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 17:13:20,746 INFO  L87              Difference]: Start difference. First operand 16125 states and 16586 transitions. Second operand  has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 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 17:13:21,543 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 17:13:21,543 INFO  L93              Difference]: Finished difference Result 31590 states and 32508 transitions.
[2024-11-11 17:13:21,543 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 17:13:21,544 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 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 1119
[2024-11-11 17:13:21,544 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 17:13:21,562 INFO  L225             Difference]: With dead ends: 31590
[2024-11-11 17:13:21,563 INFO  L226             Difference]: Without dead ends: 16125
[2024-11-11 17:13:21,575 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 17:13:21,578 INFO  L435           NwaCegarLoop]: 422 mSDtfsCounter, 220 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2024-11-11 17:13:21,579 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 428 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2024-11-11 17:13:21,589 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 16125 states.
[2024-11-11 17:13:21,721 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 16125 to 14809.
[2024-11-11 17:13:21,732 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 14809 states, 14808 states have (on average 1.0228930307941653) internal successors, (15147), 14808 states have internal predecessors, (15147), 0 states have call successors, (0), 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 17:13:21,750 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14809 states to 14809 states and 15147 transitions.
[2024-11-11 17:13:21,751 INFO  L78                 Accepts]: Start accepts. Automaton has 14809 states and 15147 transitions. Word has length 1119
[2024-11-11 17:13:21,752 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 17:13:21,752 INFO  L471      AbstractCegarLoop]: Abstraction has 14809 states and 15147 transitions.
[2024-11-11 17:13:21,752 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 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 17:13:21,753 INFO  L276                IsEmpty]: Start isEmpty. Operand 14809 states and 15147 transitions.
[2024-11-11 17:13:21,774 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1121
[2024-11-11 17:13:21,774 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 17:13:21,775 INFO  L218           NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-11 17:13:21,775 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-11-11 17:13:21,775 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 17:13:21,776 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 17:13:21,776 INFO  L85        PathProgramCache]: Analyzing trace with hash -1514156587, now seen corresponding path program 1 times
[2024-11-11 17:13:21,776 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 17:13:21,776 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19381901]
[2024-11-11 17:13:21,776 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 17:13:21,777 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 17:13:21,932 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 17:13:22,432 INFO  L134       CoverageAnalysis]: Checked inductivity of 2448 backedges. 635 proven. 0 refuted. 0 times theorem prover too weak. 1813 trivial. 0 not checked.
[2024-11-11 17:13:22,433 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 17:13:22,433 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19381901]
[2024-11-11 17:13:22,433 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19381901] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 17:13:22,433 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 17:13:22,433 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-11 17:13:22,433 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813585152]
[2024-11-11 17:13:22,433 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 17:13:22,434 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 17:13:22,434 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 17:13:22,435 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 17:13:22,435 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 17:13:22,435 INFO  L87              Difference]: Start difference. First operand 14809 states and 15147 transitions. Second operand  has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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 17:13:23,161 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 17:13:23,161 INFO  L93              Difference]: Finished difference Result 32248 states and 33030 transitions.
[2024-11-11 17:13:23,162 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 17:13:23,162 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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 1120
[2024-11-11 17:13:23,162 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 17:13:23,179 INFO  L225             Difference]: With dead ends: 32248
[2024-11-11 17:13:23,179 INFO  L226             Difference]: Without dead ends: 15796
[2024-11-11 17:13:23,202 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 17:13:23,203 INFO  L435           NwaCegarLoop]: 406 mSDtfsCounter, 274 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2024-11-11 17:13:23,203 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 411 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2024-11-11 17:13:23,219 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15796 states.
[2024-11-11 17:13:23,356 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15796 to 13164.
[2024-11-11 17:13:23,364 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13164 states, 13163 states have (on average 1.0198283066170326) internal successors, (13424), 13163 states have internal predecessors, (13424), 0 states have call successors, (0), 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 17:13:23,375 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 13424 transitions.
[2024-11-11 17:13:23,376 INFO  L78                 Accepts]: Start accepts. Automaton has 13164 states and 13424 transitions. Word has length 1120
[2024-11-11 17:13:23,377 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 17:13:23,377 INFO  L471      AbstractCegarLoop]: Abstraction has 13164 states and 13424 transitions.
[2024-11-11 17:13:23,377 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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 17:13:23,377 INFO  L276                IsEmpty]: Start isEmpty. Operand 13164 states and 13424 transitions.
[2024-11-11 17:13:23,392 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1376
[2024-11-11 17:13:23,392 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 17:13:23,393 INFO  L218           NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-11 17:13:23,393 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-11-11 17:13:23,393 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 17:13:23,394 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 17:13:23,394 INFO  L85        PathProgramCache]: Analyzing trace with hash 1199493019, now seen corresponding path program 1 times
[2024-11-11 17:13:23,394 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 17:13:23,394 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758071666]
[2024-11-11 17:13:23,394 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 17:13:23,395 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 17:13:23,502 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 17:13:24,355 INFO  L134       CoverageAnalysis]: Checked inductivity of 3942 backedges. 2413 proven. 0 refuted. 0 times theorem prover too weak. 1529 trivial. 0 not checked.
[2024-11-11 17:13:24,356 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 17:13:24,356 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758071666]
[2024-11-11 17:13:24,356 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758071666] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 17:13:24,356 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 17:13:24,356 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-11 17:13:24,356 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176929918]
[2024-11-11 17:13:24,356 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 17:13:24,358 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 17:13:24,358 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 17:13:24,358 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 17:13:24,359 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 17:13:24,359 INFO  L87              Difference]: Start difference. First operand 13164 states and 13424 transitions. Second operand  has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 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 17:13:25,006 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 17:13:25,006 INFO  L93              Difference]: Finished difference Result 26326 states and 26850 transitions.
[2024-11-11 17:13:25,007 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 17:13:25,007 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 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 1375
[2024-11-11 17:13:25,008 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 17:13:25,034 INFO  L225             Difference]: With dead ends: 26326
[2024-11-11 17:13:25,034 INFO  L226             Difference]: Without dead ends: 13822
[2024-11-11 17:13:25,048 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 17:13:25,052 INFO  L435           NwaCegarLoop]: 424 mSDtfsCounter, 224 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-11 17:13:25,053 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 430 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-11 17:13:25,060 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13822 states.
[2024-11-11 17:13:25,126 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13822 to 13822.
[2024-11-11 17:13:25,135 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13822 states, 13821 states have (on average 1.0191737211489762) internal successors, (14086), 13821 states have internal predecessors, (14086), 0 states have call successors, (0), 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 17:13:25,147 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13822 states to 13822 states and 14086 transitions.
[2024-11-11 17:13:25,147 INFO  L78                 Accepts]: Start accepts. Automaton has 13822 states and 14086 transitions. Word has length 1375
[2024-11-11 17:13:25,148 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 17:13:25,148 INFO  L471      AbstractCegarLoop]: Abstraction has 13822 states and 14086 transitions.
[2024-11-11 17:13:25,148 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 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 17:13:25,148 INFO  L276                IsEmpty]: Start isEmpty. Operand 13822 states and 14086 transitions.
[2024-11-11 17:13:25,163 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1414
[2024-11-11 17:13:25,163 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 17:13:25,164 INFO  L218           NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:13:25,164 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-11-11 17:13:25,164 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 17:13:25,164 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 17:13:25,165 INFO  L85        PathProgramCache]: Analyzing trace with hash 1468761459, now seen corresponding path program 1 times
[2024-11-11 17:13:25,165 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 17:13:25,165 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300147257]
[2024-11-11 17:13:25,165 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 17:13:25,165 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 17:13:25,265 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 17:13:26,273 INFO  L134       CoverageAnalysis]: Checked inductivity of 3703 backedges. 2644 proven. 0 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked.
[2024-11-11 17:13:26,274 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 17:13:26,274 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300147257]
[2024-11-11 17:13:26,274 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300147257] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 17:13:26,274 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 17:13:26,274 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-11 17:13:26,274 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816338485]
[2024-11-11 17:13:26,274 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 17:13:26,275 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-11 17:13:26,275 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 17:13:26,276 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-11 17:13:26,276 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-11-11 17:13:26,276 INFO  L87              Difference]: Start difference. First operand 13822 states and 14086 transitions. Second operand  has 6 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 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 17:13:27,294 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 17:13:27,294 INFO  L93              Difference]: Finished difference Result 26985 states and 27509 transitions.
[2024-11-11 17:13:27,294 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-11 17:13:27,295 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 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 1413
[2024-11-11 17:13:27,295 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 17:13:27,305 INFO  L225             Difference]: With dead ends: 26985
[2024-11-11 17:13:27,305 INFO  L226             Difference]: Without dead ends: 13823
[2024-11-11 17:13:27,311 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-11-11 17:13:27,311 INFO  L435           NwaCegarLoop]: 422 mSDtfsCounter, 357 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 1772 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 1776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2024-11-11 17:13:27,311 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 556 Invalid, 1776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1772 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2024-11-11 17:13:27,316 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13823 states.
[2024-11-11 17:13:27,372 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13823 to 13822.
[2024-11-11 17:13:27,377 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13822 states, 13821 states have (on average 1.0188843064901236) internal successors, (14082), 13821 states have internal predecessors, (14082), 0 states have call successors, (0), 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 17:13:27,386 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13822 states to 13822 states and 14082 transitions.
[2024-11-11 17:13:27,387 INFO  L78                 Accepts]: Start accepts. Automaton has 13822 states and 14082 transitions. Word has length 1413
[2024-11-11 17:13:27,387 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 17:13:27,387 INFO  L471      AbstractCegarLoop]: Abstraction has 13822 states and 14082 transitions.
[2024-11-11 17:13:27,387 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 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 17:13:27,387 INFO  L276                IsEmpty]: Start isEmpty. Operand 13822 states and 14082 transitions.
[2024-11-11 17:13:27,399 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1428
[2024-11-11 17:13:27,399 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 17:13:27,400 INFO  L218           NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2024-11-11 17:13:27,400 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-11-11 17:13:27,400 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 17:13:27,401 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 17:13:27,401 INFO  L85        PathProgramCache]: Analyzing trace with hash -1417962965, now seen corresponding path program 1 times
[2024-11-11 17:13:27,401 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 17:13:27,401 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740634853]
[2024-11-11 17:13:27,401 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 17:13:27,401 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 17:13:27,503 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 17:13:29,010 INFO  L134       CoverageAnalysis]: Checked inductivity of 3584 backedges. 2562 proven. 0 refuted. 0 times theorem prover too weak. 1022 trivial. 0 not checked.
[2024-11-11 17:13:29,010 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 17:13:29,010 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740634853]
[2024-11-11 17:13:29,010 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740634853] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 17:13:29,010 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 17:13:29,010 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-11 17:13:29,010 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599698380]
[2024-11-11 17:13:29,010 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 17:13:29,011 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-11 17:13:29,011 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 17:13:29,012 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-11 17:13:29,012 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-11 17:13:29,012 INFO  L87              Difference]: Start difference. First operand 13822 states and 14082 transitions. Second operand  has 4 states, 4 states have (on average 183.25) internal successors, (733), 4 states have internal predecessors, (733), 0 states have call successors, (0), 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 17:13:29,920 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 17:13:29,921 INFO  L93              Difference]: Finished difference Result 26994 states and 27510 transitions.
[2024-11-11 17:13:29,922 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-11-11 17:13:29,922 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 183.25) internal successors, (733), 4 states have internal predecessors, (733), 0 states have call successors, (0), 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 1427
[2024-11-11 17:13:29,922 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 17:13:29,932 INFO  L225             Difference]: With dead ends: 26994
[2024-11-11 17:13:29,932 INFO  L226             Difference]: Without dead ends: 13832
[2024-11-11 17:13:29,938 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-11 17:13:29,939 INFO  L435           NwaCegarLoop]: 422 mSDtfsCounter, 217 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1315 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2024-11-11 17:13:29,939 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 436 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1315 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2024-11-11 17:13:29,944 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13832 states.
[2024-11-11 17:13:30,004 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13832 to 13822.
[2024-11-11 17:13:30,010 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13822 states, 13821 states have (on average 1.0185948918312713) internal successors, (14078), 13821 states have internal predecessors, (14078), 0 states have call successors, (0), 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 17:13:30,022 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13822 states to 13822 states and 14078 transitions.
[2024-11-11 17:13:30,023 INFO  L78                 Accepts]: Start accepts. Automaton has 13822 states and 14078 transitions. Word has length 1427
[2024-11-11 17:13:30,023 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 17:13:30,024 INFO  L471      AbstractCegarLoop]: Abstraction has 13822 states and 14078 transitions.
[2024-11-11 17:13:30,024 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 183.25) internal successors, (733), 4 states have internal predecessors, (733), 0 states have call successors, (0), 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 17:13:30,024 INFO  L276                IsEmpty]: Start isEmpty. Operand 13822 states and 14078 transitions.
[2024-11-11 17:13:30,036 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1430
[2024-11-11 17:13:30,037 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 17:13:30,037 INFO  L218           NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-11 17:13:30,038 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-11-11 17:13:30,038 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 17:13:30,038 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 17:13:30,038 INFO  L85        PathProgramCache]: Analyzing trace with hash 1445489972, now seen corresponding path program 1 times
[2024-11-11 17:13:30,038 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 17:13:30,039 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330696323]
[2024-11-11 17:13:30,039 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 17:13:30,039 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 17:13:30,150 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 17:13:30,855 INFO  L134       CoverageAnalysis]: Checked inductivity of 3937 backedges. 1190 proven. 19 refuted. 0 times theorem prover too weak. 2728 trivial. 0 not checked.
[2024-11-11 17:13:30,856 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 17:13:30,856 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330696323]
[2024-11-11 17:13:30,856 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330696323] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-11 17:13:30,856 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107583788]
[2024-11-11 17:13:30,856 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 17:13:30,856 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-11 17:13:30,860 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-11 17:13:30,861 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-11 17:13:30,862 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-11-11 17:13:31,215 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 17:13:31,219 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1655 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-11 17:13:31,230 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2024-11-11 17:13:31,503 INFO  L134       CoverageAnalysis]: Checked inductivity of 3937 backedges. 1176 proven. 0 refuted. 0 times theorem prover too weak. 2761 trivial. 0 not checked.
[2024-11-11 17:13:31,503 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-11 17:13:31,503 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [107583788] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 17:13:31,503 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-11 17:13:31,504 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6
[2024-11-11 17:13:31,505 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891359074]
[2024-11-11 17:13:31,505 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 17:13:31,506 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 17:13:31,506 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 17:13:31,507 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 17:13:31,507 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-11-11 17:13:31,507 INFO  L87              Difference]: Start difference. First operand 13822 states and 14078 transitions. Second operand  has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 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 17:13:32,158 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 17:13:32,158 INFO  L93              Difference]: Finished difference Result 26982 states and 27491 transitions.
[2024-11-11 17:13:32,158 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 17:13:32,159 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 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 1429
[2024-11-11 17:13:32,160 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 17:13:32,160 INFO  L225             Difference]: With dead ends: 26982
[2024-11-11 17:13:32,160 INFO  L226             Difference]: Without dead ends: 0
[2024-11-11 17:13:32,167 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1433 GetRequests, 1429 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-11-11 17:13:32,168 INFO  L435           NwaCegarLoop]: 45 mSDtfsCounter, 192 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-11 17:13:32,168 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 49 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-11 17:13:32,168 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2024-11-11 17:13:32,169 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2024-11-11 17:13:32,169 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 17:13:32,169 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2024-11-11 17:13:32,169 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1429
[2024-11-11 17:13:32,169 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 17:13:32,169 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2024-11-11 17:13:32,170 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 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 17:13:32,170 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2024-11-11 17:13:32,170 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2024-11-11 17:13:32,172 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-11 17:13:32,186 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-11-11 17:13:32,373 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-11 17:13:32,376 INFO  L421         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-11 17:13:32,378 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2024-11-11 17:13:33,142 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2024-11-11 17:13:33,165 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 05:13:33 BoogieIcfgContainer
[2024-11-11 17:13:33,165 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-11 17:13:33,166 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-11 17:13:33,166 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-11-11 17:13:33,166 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-11-11 17:13:33,166 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:12:55" (3/4) ...
[2024-11-11 17:13:33,169 INFO  L142         WitnessPrinter]: Generating witness for correct program
[2024-11-11 17:13:33,199 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges
[2024-11-11 17:13:33,201 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2024-11-11 17:13:33,205 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2024-11-11 17:13:33,207 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2024-11-11 17:13:33,479 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-11 17:13:33,479 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2024-11-11 17:13:33,479 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-11 17:13:33,480 INFO  L158              Benchmark]: Toolchain (without parser) took 41077.01ms. Allocated memory was 138.4MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 61.4MB in the beginning and 1.0GB in the end (delta: -959.1MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB.
[2024-11-11 17:13:33,480 INFO  L158              Benchmark]: CDTParser took 0.15ms. Allocated memory is still 138.4MB. Free memory is still 91.0MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-11 17:13:33,480 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 791.30ms. Allocated memory was 138.4MB in the beginning and 203.4MB in the end (delta: 65.0MB). Free memory was 61.3MB in the beginning and 122.0MB in the end (delta: -60.7MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB.
[2024-11-11 17:13:33,480 INFO  L158              Benchmark]: Boogie Procedure Inliner took 126.98ms. Allocated memory is still 203.4MB. Free memory was 122.0MB in the beginning and 97.8MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2024-11-11 17:13:33,481 INFO  L158              Benchmark]: Boogie Preprocessor took 180.15ms. Allocated memory is still 203.4MB. Free memory was 97.8MB in the beginning and 63.2MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
[2024-11-11 17:13:33,481 INFO  L158              Benchmark]: RCFGBuilder took 1824.46ms. Allocated memory was 203.4MB in the beginning and 358.6MB in the end (delta: 155.2MB). Free memory was 63.2MB in the beginning and 212.3MB in the end (delta: -149.1MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB.
[2024-11-11 17:13:33,481 INFO  L158              Benchmark]: TraceAbstraction took 37835.20ms. Allocated memory was 358.6MB in the beginning and 2.3GB in the end (delta: 2.0GB). Free memory was 211.3MB in the beginning and 1.0GB in the end (delta: -834.5MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB.
[2024-11-11 17:13:33,481 INFO  L158              Benchmark]: Witness Printer took 313.41ms. Allocated memory is still 2.3GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2024-11-11 17:13:33,483 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 138.4MB. Free memory is still 91.0MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 791.30ms. Allocated memory was 138.4MB in the beginning and 203.4MB in the end (delta: 65.0MB). Free memory was 61.3MB in the beginning and 122.0MB in the end (delta: -60.7MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 126.98ms. Allocated memory is still 203.4MB. Free memory was 122.0MB in the beginning and 97.8MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 180.15ms. Allocated memory is still 203.4MB. Free memory was 97.8MB in the beginning and 63.2MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
 * RCFGBuilder took 1824.46ms. Allocated memory was 203.4MB in the beginning and 358.6MB in the end (delta: 155.2MB). Free memory was 63.2MB in the beginning and 212.3MB in the end (delta: -149.1MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB.
 * TraceAbstraction took 37835.20ms. Allocated memory was 358.6MB in the beginning and 2.3GB in the end (delta: 2.0GB). Free memory was 211.3MB in the beginning and 1.0GB in the end (delta: -834.5MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB.
 * Witness Printer took 313.41ms. Allocated memory is still 2.3GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. 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: 122]: 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, 396 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 37.0s, OverallIterations: 21, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 20.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5222 SdHoareTripleChecker+Valid, 18.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5222 mSDsluCounter, 6379 SdHoareTripleChecker+Invalid, 15.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 323 mSDsCounter, 2821 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20572 IncrementalHoareTripleChecker+Invalid, 23393 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2821 mSolverCounterUnsat, 6056 mSDtfsCounter, 20572 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3411 GetRequests, 3367 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16125occurred in iteration=14, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 21 MinimizatonAttempts, 8565 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 11.3s InterpolantComputationTime, 18180 NumberOfCodeBlocks, 18180 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 18156 ConstructedInterpolants, 0 QuantifiedInterpolants, 43737 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3862 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 24 InterpolantComputations, 21 PerfectInterpolantSequences, 32259/33642 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: 1783]: Loop Invariant
    Derived loop invariant: ((((((((((((((((((((((((((a16 == 9) && (7 == a12)) || (((a16 == 8) && (5 == a12)) && (a15 == 3))) || (((((0 <= ((long long) 87 + a18)) && (10 <= a16)) && (5 == a12)) && (a16 <= 11)) && (a15 == 3))) || (((a16 == 9) && (a12 == 6)) && (4 <= a15))) || (((a12 == 9) && (a15 <= 3)) && (a16 == 12))) || ((a12 == 9) && (a16 == 9))) || (((a16 == 8) && (a15 == 4)) && (7 == a12))) || ((a16 <= 8) && (a12 == 9))) || (((a15 <= 3) && (a16 <= 11)) && (7 == a12))) || ((a16 <= 8) && (a12 == 6))) || ((((a15 <= 3) && (a12 == 8)) && (10 <= a16)) && (a16 <= 11))) || (((a12 == 9) && (a15 <= 3)) && (a16 <= 11))) || ((((a12 <= 5) && (10 <= a16)) && (a16 <= 11)) && (4 <= a15))) || ((((0 <= ((long long) 87 + a18)) && (a15 <= 3)) && (a12 == 6)) && (a16 == 12))) || ((a16 == 9) && (a12 == 8))) || (((10 <= a16) && (a12 == 6)) && (a16 <= 11))) || (((a15 <= 3) && (a16 == 12)) && (7 == a12))) || (((a16 <= 8) && (0 <= ((long long) 87 + a18))) && (a12 == 8))) || (((a16 == 9) && (5 == a12)) && (a15 == 3))) || ((((a16 <= 8) && (0 <= ((long long) 87 + a18))) && (a15 <= 3)) && (7 <= a12))) || (((a16 == 8) && (a15 == 4)) && (5 == a12))) || (((a15 <= 3) && (a12 == 8)) && (a16 == 12))) || ((((a16 <= 8) && (a12 == 8)) && (((long long) a18 + 156) <= 0)) && (4 <= a15))) || (((a16 == 12) && (5 == a12)) && (a15 == 3))) || (((a12 <= 5) && (a16 == 9)) && (4 <= a15)))
RESULT: Ultimate proved your program to be correct!
[2024-11-11 17:13:33,532 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

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