./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.ufo.UNBOUNDED.pals.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/seq-mthreaded/pals_opt-floodmax.4.ufo.UNBOUNDED.pals.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 d72d7c845292578ad4711d5954bbaa34eac8266f0504ea14ab2c6e0b02bee46d
--- Real Ultimate output ---
This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m
[2024-11-11 21:21:08,218 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-11 21:21:08,299 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-11 21:21:08,304 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-11 21:21:08,305 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-11 21:21:08,343 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-11 21:21:08,345 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-11 21:21:08,346 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-11 21:21:08,346 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-11 21:21:08,347 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-11 21:21:08,348 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-11 21:21:08,348 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-11 21:21:08,349 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-11 21:21:08,349 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-11 21:21:08,349 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-11 21:21:08,351 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-11 21:21:08,351 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-11 21:21:08,352 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-11 21:21:08,352 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-11 21:21:08,352 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-11 21:21:08,352 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-11 21:21:08,353 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-11 21:21:08,353 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-11 21:21:08,354 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-11 21:21:08,354 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-11 21:21:08,354 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-11 21:21:08,354 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-11 21:21:08,355 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-11 21:21:08,355 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-11 21:21:08,355 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-11 21:21:08,356 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-11 21:21:08,356 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-11 21:21:08,356 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-11 21:21:08,356 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-11 21:21:08,357 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-11 21:21:08,357 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-11 21:21:08,357 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-11 21:21:08,357 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-11 21:21:08,358 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-11 21:21:08,358 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-11 21:21:08,358 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-11 21:21:08,359 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-11 21:21:08,360 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 -> d72d7c845292578ad4711d5954bbaa34eac8266f0504ea14ab2c6e0b02bee46d
[2024-11-11 21:21:08,634 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-11 21:21:08,659 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-11 21:21:08,663 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-11 21:21:08,664 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-11 21:21:08,665 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-11 21:21:08,666 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c
[2024-11-11 21:21:10,194 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-11 21:21:10,452 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-11 21:21:10,453 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c
[2024-11-11 21:21:10,476 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b03e6ad18/b09c28a374f9422bbd59c949e91ca849/FLAGd39646fc2
[2024-11-11 21:21:10,495 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b03e6ad18/b09c28a374f9422bbd59c949e91ca849
[2024-11-11 21:21:10,498 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-11 21:21:10,500 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-11 21:21:10,502 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-11 21:21:10,502 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-11 21:21:10,508 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-11 21:21:10,509 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:21:10" (1/1) ...
[2024-11-11 21:21:10,510 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@543b31ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:21:10, skipping insertion in model container
[2024-11-11 21:21:10,510 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:21:10" (1/1) ...
[2024-11-11 21:21:10,562 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-11 21:21:10,962 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/seq-mthreaded/pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c[31211,31224]
[2024-11-11 21:21:10,969 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-11 21:21:10,988 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-11 21:21:11,069 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/seq-mthreaded/pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c[31211,31224]
[2024-11-11 21:21:11,069 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-11 21:21:11,101 INFO  L204         MainTranslator]: Completed translation
[2024-11-11 21:21:11,101 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:21:11 WrapperNode
[2024-11-11 21:21:11,102 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-11 21:21:11,103 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-11 21:21:11,103 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-11 21:21:11,103 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-11 21:21:11,110 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:21:11" (1/1) ...
[2024-11-11 21:21:11,129 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:21:11" (1/1) ...
[2024-11-11 21:21:11,196 INFO  L138                Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 1025
[2024-11-11 21:21:11,196 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-11 21:21:11,197 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-11 21:21:11,197 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-11 21:21:11,197 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-11 21:21:11,211 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:21:11" (1/1) ...
[2024-11-11 21:21:11,211 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:21:11" (1/1) ...
[2024-11-11 21:21:11,216 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:21:11" (1/1) ...
[2024-11-11 21:21:11,245 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 21:21:11,246 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:21:11" (1/1) ...
[2024-11-11 21:21:11,246 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:21:11" (1/1) ...
[2024-11-11 21:21:11,267 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:21:11" (1/1) ...
[2024-11-11 21:21:11,290 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:21:11" (1/1) ...
[2024-11-11 21:21:11,299 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:21:11" (1/1) ...
[2024-11-11 21:21:11,312 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:21:11" (1/1) ...
[2024-11-11 21:21:11,323 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-11 21:21:11,325 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-11 21:21:11,326 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-11 21:21:11,326 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-11 21:21:11,327 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:21:11" (1/1) ...
[2024-11-11 21:21:11,332 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-11 21:21:11,344 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-11 21:21:11,364 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 21:21:11,367 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 21:21:11,420 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-11 21:21:11,420 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-11 21:21:11,421 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-11 21:21:11,422 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-11 21:21:11,563 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-11 21:21:11,567 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-11 21:21:12,719 INFO  L?                        ?]: Removed 115 outVars from TransFormulas that were not future-live.
[2024-11-11 21:21:12,720 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-11 21:21:12,753 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-11 21:21:12,755 INFO  L316             CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-11 21:21:12,755 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:21:12 BoogieIcfgContainer
[2024-11-11 21:21:12,756 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-11 21:21:12,759 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-11 21:21:12,759 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-11 21:21:12,762 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-11 21:21:12,762 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:21:10" (1/3) ...
[2024-11-11 21:21:12,763 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33745566 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:21:12, skipping insertion in model container
[2024-11-11 21:21:12,763 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:21:11" (2/3) ...
[2024-11-11 21:21:12,763 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33745566 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:21:12, skipping insertion in model container
[2024-11-11 21:21:12,763 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:21:12" (3/3) ...
[2024-11-11 21:21:12,765 INFO  L112   eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c
[2024-11-11 21:21:12,778 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-11 21:21:12,778 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-11 21:21:12,858 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-11 21:21:12,864 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;@13933822, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-11 21:21:12,865 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-11 21:21:12,872 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 309 states, 307 states have (on average 1.8241042345276872) internal successors, (560), 308 states have internal predecessors, (560), 0 states have call successors, (0), 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 21:21:12,886 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2024-11-11 21:21:12,887 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 21:21:12,888 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-11 21:21:12,888 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 21:21:12,895 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 21:21:12,895 INFO  L85        PathProgramCache]: Analyzing trace with hash 1857685174, now seen corresponding path program 1 times
[2024-11-11 21:21:12,904 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 21:21:12,905 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875603877]
[2024-11-11 21:21:12,906 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 21:21:12,906 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 21:21:13,246 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 21:21:13,454 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 21:21:13,455 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 21:21:13,455 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875603877]
[2024-11-11 21:21:13,457 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875603877] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 21:21:13,457 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 21:21:13,457 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-11 21:21:13,459 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854997613]
[2024-11-11 21:21:13,460 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 21:21:13,465 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-11 21:21:13,466 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 21:21:13,490 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-11 21:21:13,490 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-11 21:21:13,496 INFO  L87              Difference]: Start difference. First operand  has 309 states, 307 states have (on average 1.8241042345276872) internal successors, (560), 308 states have internal predecessors, (560), 0 states have call successors, (0), 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 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 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 21:21:13,543 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 21:21:13,544 INFO  L93              Difference]: Finished difference Result 419 states and 755 transitions.
[2024-11-11 21:21:13,546 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-11-11 21:21:13,547 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 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 77
[2024-11-11 21:21:13,548 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 21:21:13,562 INFO  L225             Difference]: With dead ends: 419
[2024-11-11 21:21:13,562 INFO  L226             Difference]: Without dead ends: 305
[2024-11-11 21:21:13,566 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-11 21:21:13,569 INFO  L435           NwaCegarLoop]: 553 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-11 21:21:13,570 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-11 21:21:13,590 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 305 states.
[2024-11-11 21:21:13,635 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305.
[2024-11-11 21:21:13,639 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 305 states, 304 states have (on average 1.819078947368421) internal successors, (553), 304 states have internal predecessors, (553), 0 states have call successors, (0), 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 21:21:13,646 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 553 transitions.
[2024-11-11 21:21:13,648 INFO  L78                 Accepts]: Start accepts. Automaton has 305 states and 553 transitions. Word has length 77
[2024-11-11 21:21:13,648 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 21:21:13,648 INFO  L471      AbstractCegarLoop]: Abstraction has 305 states and 553 transitions.
[2024-11-11 21:21:13,649 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 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 21:21:13,649 INFO  L276                IsEmpty]: Start isEmpty. Operand 305 states and 553 transitions.
[2024-11-11 21:21:13,652 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2024-11-11 21:21:13,652 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 21:21:13,652 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-11 21:21:13,653 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-11 21:21:13,653 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 21:21:13,654 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 21:21:13,654 INFO  L85        PathProgramCache]: Analyzing trace with hash 1723671668, now seen corresponding path program 1 times
[2024-11-11 21:21:13,654 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 21:21:13,655 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732461654]
[2024-11-11 21:21:13,655 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 21:21:13,655 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 21:21:13,772 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 21:21:14,147 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 21:21:14,148 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 21:21:14,149 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732461654]
[2024-11-11 21:21:14,149 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732461654] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 21:21:14,149 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 21:21:14,149 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-11 21:21:14,149 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229664039]
[2024-11-11 21:21:14,150 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 21:21:14,152 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-11 21:21:14,153 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 21:21:14,154 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-11 21:21:14,155 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-11 21:21:14,155 INFO  L87              Difference]: Start difference. First operand 305 states and 553 transitions. Second operand  has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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 21:21:14,357 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 21:21:14,357 INFO  L93              Difference]: Finished difference Result 418 states and 748 transitions.
[2024-11-11 21:21:14,361 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-11-11 21:21:14,362 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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 77
[2024-11-11 21:21:14,362 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 21:21:14,364 INFO  L225             Difference]: With dead ends: 418
[2024-11-11 21:21:14,364 INFO  L226             Difference]: Without dead ends: 305
[2024-11-11 21:21:14,368 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-11 21:21:14,369 INFO  L435           NwaCegarLoop]: 551 mSDtfsCounter, 0 mSDsluCounter, 1602 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2153 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-11 21:21:14,369 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2153 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-11 21:21:14,371 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 305 states.
[2024-11-11 21:21:14,385 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305.
[2024-11-11 21:21:14,390 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 305 states, 304 states have (on average 1.667763157894737) internal successors, (507), 304 states have internal predecessors, (507), 0 states have call successors, (0), 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 21:21:14,391 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 507 transitions.
[2024-11-11 21:21:14,391 INFO  L78                 Accepts]: Start accepts. Automaton has 305 states and 507 transitions. Word has length 77
[2024-11-11 21:21:14,391 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 21:21:14,394 INFO  L471      AbstractCegarLoop]: Abstraction has 305 states and 507 transitions.
[2024-11-11 21:21:14,394 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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 21:21:14,394 INFO  L276                IsEmpty]: Start isEmpty. Operand 305 states and 507 transitions.
[2024-11-11 21:21:14,402 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 123
[2024-11-11 21:21:14,402 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 21:21:14,402 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-11 21:21:14,403 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-11 21:21:14,403 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 21:21:14,404 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 21:21:14,406 INFO  L85        PathProgramCache]: Analyzing trace with hash 1503263658, now seen corresponding path program 1 times
[2024-11-11 21:21:14,406 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 21:21:14,406 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278894182]
[2024-11-11 21:21:14,407 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 21:21:14,407 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 21:21:14,485 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 21:21:14,689 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 21:21:14,690 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 21:21:14,690 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278894182]
[2024-11-11 21:21:14,690 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278894182] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 21:21:14,691 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 21:21:14,691 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-11 21:21:14,691 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994537672]
[2024-11-11 21:21:14,691 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 21:21:14,692 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 21:21:14,693 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 21:21:14,694 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 21:21:14,695 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 21:21:14,695 INFO  L87              Difference]: Start difference. First operand 305 states and 507 transitions. Second operand  has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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 21:21:14,759 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 21:21:14,759 INFO  L93              Difference]: Finished difference Result 511 states and 867 transitions.
[2024-11-11 21:21:14,760 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 21:21:14,760 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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 122
[2024-11-11 21:21:14,761 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 21:21:14,763 INFO  L225             Difference]: With dead ends: 511
[2024-11-11 21:21:14,763 INFO  L226             Difference]: Without dead ends: 402
[2024-11-11 21:21:14,765 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 21:21:14,766 INFO  L435           NwaCegarLoop]: 500 mSDtfsCounter, 160 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-11 21:21:14,768 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 950 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-11 21:21:14,769 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 402 states.
[2024-11-11 21:21:14,784 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 399.
[2024-11-11 21:21:14,789 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 399 states, 398 states have (on average 1.678391959798995) internal successors, (668), 398 states have internal predecessors, (668), 0 states have call successors, (0), 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 21:21:14,790 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 668 transitions.
[2024-11-11 21:21:14,791 INFO  L78                 Accepts]: Start accepts. Automaton has 399 states and 668 transitions. Word has length 122
[2024-11-11 21:21:14,791 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 21:21:14,791 INFO  L471      AbstractCegarLoop]: Abstraction has 399 states and 668 transitions.
[2024-11-11 21:21:14,793 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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 21:21:14,793 INFO  L276                IsEmpty]: Start isEmpty. Operand 399 states and 668 transitions.
[2024-11-11 21:21:14,795 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 126
[2024-11-11 21:21:14,798 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 21:21:14,798 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-11 21:21:14,798 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-11 21:21:14,798 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 21:21:14,799 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 21:21:14,799 INFO  L85        PathProgramCache]: Analyzing trace with hash 1698701903, now seen corresponding path program 1 times
[2024-11-11 21:21:14,799 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 21:21:14,799 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334204873]
[2024-11-11 21:21:14,800 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 21:21:14,800 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 21:21:14,875 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 21:21:15,039 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 21:21:15,039 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 21:21:15,040 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334204873]
[2024-11-11 21:21:15,040 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334204873] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 21:21:15,040 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 21:21:15,040 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-11 21:21:15,042 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334902935]
[2024-11-11 21:21:15,042 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 21:21:15,043 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 21:21:15,043 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 21:21:15,044 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 21:21:15,044 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 21:21:15,045 INFO  L87              Difference]: Start difference. First operand 399 states and 668 transitions. Second operand  has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 21:21:15,094 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 21:21:15,094 INFO  L93              Difference]: Finished difference Result 785 states and 1336 transitions.
[2024-11-11 21:21:15,095 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 21:21:15,095 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 125
[2024-11-11 21:21:15,097 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 21:21:15,101 INFO  L225             Difference]: With dead ends: 785
[2024-11-11 21:21:15,101 INFO  L226             Difference]: Without dead ends: 582
[2024-11-11 21:21:15,103 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 21:21:15,107 INFO  L435           NwaCegarLoop]: 504 mSDtfsCounter, 161 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-11 21:21:15,107 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 963 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-11 21:21:15,109 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 582 states.
[2024-11-11 21:21:15,121 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 578.
[2024-11-11 21:21:15,123 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 578 states, 577 states have (on average 1.6932409012131715) internal successors, (977), 577 states have internal predecessors, (977), 0 states have call successors, (0), 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 21:21:15,125 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 977 transitions.
[2024-11-11 21:21:15,125 INFO  L78                 Accepts]: Start accepts. Automaton has 578 states and 977 transitions. Word has length 125
[2024-11-11 21:21:15,125 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 21:21:15,126 INFO  L471      AbstractCegarLoop]: Abstraction has 578 states and 977 transitions.
[2024-11-11 21:21:15,126 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 21:21:15,126 INFO  L276                IsEmpty]: Start isEmpty. Operand 578 states and 977 transitions.
[2024-11-11 21:21:15,127 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 129
[2024-11-11 21:21:15,127 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 21:21:15,128 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-11 21:21:15,128 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-11 21:21:15,128 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 21:21:15,128 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 21:21:15,128 INFO  L85        PathProgramCache]: Analyzing trace with hash 490600502, now seen corresponding path program 1 times
[2024-11-11 21:21:15,129 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 21:21:15,130 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136962119]
[2024-11-11 21:21:15,130 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 21:21:15,131 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 21:21:15,184 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 21:21:15,318 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 21:21:15,319 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 21:21:15,319 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136962119]
[2024-11-11 21:21:15,319 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136962119] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 21:21:15,319 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 21:21:15,319 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-11 21:21:15,319 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70580435]
[2024-11-11 21:21:15,320 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 21:21:15,320 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 21:21:15,320 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 21:21:15,321 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 21:21:15,321 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 21:21:15,321 INFO  L87              Difference]: Start difference. First operand 578 states and 977 transitions. Second operand  has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 21:21:15,363 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 21:21:15,363 INFO  L93              Difference]: Finished difference Result 1302 states and 2227 transitions.
[2024-11-11 21:21:15,363 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 21:21:15,364 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 128
[2024-11-11 21:21:15,364 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 21:21:15,367 INFO  L225             Difference]: With dead ends: 1302
[2024-11-11 21:21:15,368 INFO  L226             Difference]: Without dead ends: 920
[2024-11-11 21:21:15,368 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 21:21:15,369 INFO  L435           NwaCegarLoop]: 504 mSDtfsCounter, 154 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-11 21:21:15,370 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 964 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-11 21:21:15,371 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 920 states.
[2024-11-11 21:21:15,384 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 914.
[2024-11-11 21:21:15,385 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 914 states, 913 states have (on average 1.7009857612267252) internal successors, (1553), 913 states have internal predecessors, (1553), 0 states have call successors, (0), 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 21:21:15,388 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1553 transitions.
[2024-11-11 21:21:15,388 INFO  L78                 Accepts]: Start accepts. Automaton has 914 states and 1553 transitions. Word has length 128
[2024-11-11 21:21:15,388 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 21:21:15,388 INFO  L471      AbstractCegarLoop]: Abstraction has 914 states and 1553 transitions.
[2024-11-11 21:21:15,389 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 21:21:15,389 INFO  L276                IsEmpty]: Start isEmpty. Operand 914 states and 1553 transitions.
[2024-11-11 21:21:15,390 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 132
[2024-11-11 21:21:15,390 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 21:21:15,391 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-11 21:21:15,391 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-11 21:21:15,391 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 21:21:15,391 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 21:21:15,392 INFO  L85        PathProgramCache]: Analyzing trace with hash 1051719067, now seen corresponding path program 1 times
[2024-11-11 21:21:15,392 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 21:21:15,392 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407000659]
[2024-11-11 21:21:15,392 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 21:21:15,392 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 21:21:15,450 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 21:21:15,559 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 21:21:15,560 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 21:21:15,560 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407000659]
[2024-11-11 21:21:15,560 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407000659] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 21:21:15,560 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 21:21:15,560 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-11 21:21:15,560 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149495035]
[2024-11-11 21:21:15,561 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 21:21:15,561 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 21:21:15,561 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 21:21:15,562 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 21:21:15,562 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 21:21:15,562 INFO  L87              Difference]: Start difference. First operand 914 states and 1553 transitions. Second operand  has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 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 21:21:15,613 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 21:21:15,613 INFO  L93              Difference]: Finished difference Result 2270 states and 3883 transitions.
[2024-11-11 21:21:15,614 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 21:21:15,614 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 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 131
[2024-11-11 21:21:15,614 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 21:21:15,620 INFO  L225             Difference]: With dead ends: 2270
[2024-11-11 21:21:15,620 INFO  L226             Difference]: Without dead ends: 1552
[2024-11-11 21:21:15,622 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 21:21:15,623 INFO  L435           NwaCegarLoop]: 503 mSDtfsCounter, 146 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-11 21:21:15,623 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 962 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-11 21:21:15,625 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1552 states.
[2024-11-11 21:21:15,647 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1542.
[2024-11-11 21:21:15,649 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1542 states, 1541 states have (on average 1.6956521739130435) internal successors, (2613), 1541 states have internal predecessors, (2613), 0 states have call successors, (0), 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 21:21:15,653 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2613 transitions.
[2024-11-11 21:21:15,654 INFO  L78                 Accepts]: Start accepts. Automaton has 1542 states and 2613 transitions. Word has length 131
[2024-11-11 21:21:15,654 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 21:21:15,654 INFO  L471      AbstractCegarLoop]: Abstraction has 1542 states and 2613 transitions.
[2024-11-11 21:21:15,654 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 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 21:21:15,654 INFO  L276                IsEmpty]: Start isEmpty. Operand 1542 states and 2613 transitions.
[2024-11-11 21:21:15,656 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 135
[2024-11-11 21:21:15,656 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 21:21:15,656 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:21:15,657 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-11 21:21:15,657 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 21:21:15,657 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 21:21:15,657 INFO  L85        PathProgramCache]: Analyzing trace with hash 1198235708, now seen corresponding path program 1 times
[2024-11-11 21:21:15,658 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 21:21:15,658 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215227474]
[2024-11-11 21:21:15,658 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 21:21:15,658 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 21:21:15,698 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 21:21:15,923 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 21:21:15,923 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 21:21:15,923 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215227474]
[2024-11-11 21:21:15,924 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215227474] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 21:21:15,924 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 21:21:15,924 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-11 21:21:15,924 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848888737]
[2024-11-11 21:21:15,924 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 21:21:15,925 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-11 21:21:15,925 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 21:21:15,926 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-11 21:21:15,926 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-11 21:21:15,927 INFO  L87              Difference]: Start difference. First operand 1542 states and 2613 transitions. Second operand  has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 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 21:21:16,261 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 21:21:16,261 INFO  L93              Difference]: Finished difference Result 7882 states and 13549 transitions.
[2024-11-11 21:21:16,262 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-11-11 21:21:16,262 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 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 134
[2024-11-11 21:21:16,262 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 21:21:16,288 INFO  L225             Difference]: With dead ends: 7882
[2024-11-11 21:21:16,289 INFO  L226             Difference]: Without dead ends: 6536
[2024-11-11 21:21:16,293 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2024-11-11 21:21:16,294 INFO  L435           NwaCegarLoop]: 504 mSDtfsCounter, 1778 mSDsluCounter, 3009 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1778 SdHoareTripleChecker+Valid, 3513 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-11 21:21:16,295 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1778 Valid, 3513 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-11 21:21:16,301 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6536 states.
[2024-11-11 21:21:16,380 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6536 to 2797.
[2024-11-11 21:21:16,385 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2797 states, 2796 states have (on average 1.699928469241774) internal successors, (4753), 2796 states have internal predecessors, (4753), 0 states have call successors, (0), 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 21:21:16,393 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2797 states to 2797 states and 4753 transitions.
[2024-11-11 21:21:16,393 INFO  L78                 Accepts]: Start accepts. Automaton has 2797 states and 4753 transitions. Word has length 134
[2024-11-11 21:21:16,393 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 21:21:16,394 INFO  L471      AbstractCegarLoop]: Abstraction has 2797 states and 4753 transitions.
[2024-11-11 21:21:16,394 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 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 21:21:16,394 INFO  L276                IsEmpty]: Start isEmpty. Operand 2797 states and 4753 transitions.
[2024-11-11 21:21:16,396 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 136
[2024-11-11 21:21:16,396 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 21:21:16,396 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:21:16,396 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-11 21:21:16,397 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 21:21:16,397 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 21:21:16,397 INFO  L85        PathProgramCache]: Analyzing trace with hash 690961965, now seen corresponding path program 1 times
[2024-11-11 21:21:16,397 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 21:21:16,398 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514680353]
[2024-11-11 21:21:16,398 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 21:21:16,398 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 21:21:16,440 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 21:21:16,626 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 21:21:16,627 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 21:21:16,627 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514680353]
[2024-11-11 21:21:16,628 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514680353] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 21:21:16,628 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 21:21:16,628 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-11 21:21:16,628 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706688808]
[2024-11-11 21:21:16,629 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 21:21:16,629 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-11 21:21:16,629 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 21:21:16,630 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-11 21:21:16,630 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-11 21:21:16,630 INFO  L87              Difference]: Start difference. First operand 2797 states and 4753 transitions. Second operand  has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 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 21:21:16,756 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 21:21:16,756 INFO  L93              Difference]: Finished difference Result 8150 states and 13964 transitions.
[2024-11-11 21:21:16,757 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-11 21:21:16,757 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 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 135
[2024-11-11 21:21:16,757 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 21:21:16,777 INFO  L225             Difference]: With dead ends: 8150
[2024-11-11 21:21:16,778 INFO  L226             Difference]: Without dead ends: 5549
[2024-11-11 21:21:16,784 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 21:21:16,785 INFO  L435           NwaCegarLoop]: 498 mSDtfsCounter, 553 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 1497 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-11 21:21:16,785 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 1497 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-11 21:21:16,793 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5549 states.
[2024-11-11 21:21:16,896 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5549 to 4156.
[2024-11-11 21:21:16,905 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4156 states, 4155 states have (on average 1.7037304452466908) internal successors, (7079), 4155 states have internal predecessors, (7079), 0 states have call successors, (0), 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 21:21:16,918 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4156 states to 4156 states and 7079 transitions.
[2024-11-11 21:21:16,919 INFO  L78                 Accepts]: Start accepts. Automaton has 4156 states and 7079 transitions. Word has length 135
[2024-11-11 21:21:16,920 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 21:21:16,920 INFO  L471      AbstractCegarLoop]: Abstraction has 4156 states and 7079 transitions.
[2024-11-11 21:21:16,921 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 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 21:21:16,921 INFO  L276                IsEmpty]: Start isEmpty. Operand 4156 states and 7079 transitions.
[2024-11-11 21:21:16,923 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 137
[2024-11-11 21:21:16,923 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 21:21:16,923 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:21:16,924 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-11 21:21:16,924 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 21:21:16,924 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 21:21:16,924 INFO  L85        PathProgramCache]: Analyzing trace with hash -1980617837, now seen corresponding path program 1 times
[2024-11-11 21:21:16,925 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 21:21:16,925 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705882958]
[2024-11-11 21:21:16,925 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 21:21:16,925 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 21:21:16,987 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 21:21:17,143 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 21:21:17,144 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 21:21:17,144 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705882958]
[2024-11-11 21:21:17,144 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705882958] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 21:21:17,144 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 21:21:17,144 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-11 21:21:17,145 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070872558]
[2024-11-11 21:21:17,145 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 21:21:17,146 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-11 21:21:17,146 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 21:21:17,146 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-11 21:21:17,147 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-11 21:21:17,147 INFO  L87              Difference]: Start difference. First operand 4156 states and 7079 transitions. Second operand  has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 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 21:21:17,310 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 21:21:17,312 INFO  L93              Difference]: Finished difference Result 12168 states and 20812 transitions.
[2024-11-11 21:21:17,313 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-11 21:21:17,313 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 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 136
[2024-11-11 21:21:17,314 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 21:21:17,353 INFO  L225             Difference]: With dead ends: 12168
[2024-11-11 21:21:17,353 INFO  L226             Difference]: Without dead ends: 8208
[2024-11-11 21:21:17,368 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 21:21:17,370 INFO  L435           NwaCegarLoop]: 498 mSDtfsCounter, 551 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1627 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-11 21:21:17,370 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 1627 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-11 21:21:17,381 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8208 states.
[2024-11-11 21:21:17,548 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8208 to 6158.
[2024-11-11 21:21:17,558 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6158 states, 6157 states have (on average 1.7013155757674192) internal successors, (10475), 6157 states have internal predecessors, (10475), 0 states have call successors, (0), 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 21:21:17,577 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6158 states to 6158 states and 10475 transitions.
[2024-11-11 21:21:17,578 INFO  L78                 Accepts]: Start accepts. Automaton has 6158 states and 10475 transitions. Word has length 136
[2024-11-11 21:21:17,579 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 21:21:17,579 INFO  L471      AbstractCegarLoop]: Abstraction has 6158 states and 10475 transitions.
[2024-11-11 21:21:17,579 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 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 21:21:17,579 INFO  L276                IsEmpty]: Start isEmpty. Operand 6158 states and 10475 transitions.
[2024-11-11 21:21:17,582 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 138
[2024-11-11 21:21:17,582 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 21:21:17,583 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:21:17,583 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-11 21:21:17,583 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 21:21:17,583 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 21:21:17,584 INFO  L85        PathProgramCache]: Analyzing trace with hash 1268758564, now seen corresponding path program 1 times
[2024-11-11 21:21:17,584 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 21:21:17,584 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430906004]
[2024-11-11 21:21:17,584 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 21:21:17,584 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 21:21:17,627 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 21:21:17,787 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 21:21:17,788 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 21:21:17,788 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430906004]
[2024-11-11 21:21:17,788 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430906004] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 21:21:17,788 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 21:21:17,788 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-11 21:21:17,789 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526299049]
[2024-11-11 21:21:17,789 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 21:21:17,789 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-11 21:21:17,789 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 21:21:17,790 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-11 21:21:17,792 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-11 21:21:17,792 INFO  L87              Difference]: Start difference. First operand 6158 states and 10475 transitions. Second operand  has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 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 21:21:17,998 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 21:21:17,998 INFO  L93              Difference]: Finished difference Result 18112 states and 30920 transitions.
[2024-11-11 21:21:17,999 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-11 21:21:17,999 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 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 137
[2024-11-11 21:21:18,000 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 21:21:18,030 INFO  L225             Difference]: With dead ends: 18112
[2024-11-11 21:21:18,030 INFO  L226             Difference]: Without dead ends: 12150
[2024-11-11 21:21:18,044 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 21:21:18,045 INFO  L435           NwaCegarLoop]: 508 mSDtfsCounter, 549 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1639 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-11 21:21:18,046 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 1639 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-11 21:21:18,059 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12150 states.
[2024-11-11 21:21:18,345 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12150 to 9120.
[2024-11-11 21:21:18,364 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9120 states, 9119 states have (on average 1.6985415067441605) internal successors, (15489), 9119 states have internal predecessors, (15489), 0 states have call successors, (0), 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 21:21:18,388 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9120 states to 9120 states and 15489 transitions.
[2024-11-11 21:21:18,388 INFO  L78                 Accepts]: Start accepts. Automaton has 9120 states and 15489 transitions. Word has length 137
[2024-11-11 21:21:18,389 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 21:21:18,389 INFO  L471      AbstractCegarLoop]: Abstraction has 9120 states and 15489 transitions.
[2024-11-11 21:21:18,389 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 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 21:21:18,390 INFO  L276                IsEmpty]: Start isEmpty. Operand 9120 states and 15489 transitions.
[2024-11-11 21:21:18,394 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 139
[2024-11-11 21:21:18,394 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 21:21:18,395 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:21:18,395 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-11 21:21:18,395 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 21:21:18,395 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 21:21:18,396 INFO  L85        PathProgramCache]: Analyzing trace with hash -1198283606, now seen corresponding path program 1 times
[2024-11-11 21:21:18,396 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 21:21:18,396 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907223914]
[2024-11-11 21:21:18,396 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 21:21:18,396 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 21:21:18,441 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 21:21:18,532 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 21:21:18,534 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 21:21:18,535 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907223914]
[2024-11-11 21:21:18,535 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907223914] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 21:21:18,535 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 21:21:18,535 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-11 21:21:18,535 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112253633]
[2024-11-11 21:21:18,535 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 21:21:18,536 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 21:21:18,536 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 21:21:18,536 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 21:21:18,536 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 21:21:18,537 INFO  L87              Difference]: Start difference. First operand 9120 states and 15489 transitions. Second operand  has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 21:21:18,693 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 21:21:18,693 INFO  L93              Difference]: Finished difference Result 20516 states and 34824 transitions.
[2024-11-11 21:21:18,694 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 21:21:18,694 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 138
[2024-11-11 21:21:18,694 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 21:21:18,726 INFO  L225             Difference]: With dead ends: 20516
[2024-11-11 21:21:18,727 INFO  L226             Difference]: Without dead ends: 14220
[2024-11-11 21:21:18,741 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 21:21:18,742 INFO  L435           NwaCegarLoop]: 583 mSDtfsCounter, 153 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-11 21:21:18,742 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1060 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-11 21:21:18,757 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14220 states.
[2024-11-11 21:21:19,041 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14220 to 14218.
[2024-11-11 21:21:19,070 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 14218 states, 14217 states have (on average 1.6875571498909756) internal successors, (23992), 14217 states have internal predecessors, (23992), 0 states have call successors, (0), 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 21:21:19,105 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14218 states to 14218 states and 23992 transitions.
[2024-11-11 21:21:19,106 INFO  L78                 Accepts]: Start accepts. Automaton has 14218 states and 23992 transitions. Word has length 138
[2024-11-11 21:21:19,107 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 21:21:19,107 INFO  L471      AbstractCegarLoop]: Abstraction has 14218 states and 23992 transitions.
[2024-11-11 21:21:19,107 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 21:21:19,108 INFO  L276                IsEmpty]: Start isEmpty. Operand 14218 states and 23992 transitions.
[2024-11-11 21:21:19,110 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 139
[2024-11-11 21:21:19,110 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 21:21:19,110 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:21:19,111 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-11 21:21:19,111 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 21:21:19,111 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 21:21:19,111 INFO  L85        PathProgramCache]: Analyzing trace with hash -910783766, now seen corresponding path program 1 times
[2024-11-11 21:21:19,112 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 21:21:19,112 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248867038]
[2024-11-11 21:21:19,112 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 21:21:19,112 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 21:21:19,152 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 21:21:19,265 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 21:21:19,266 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 21:21:19,266 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248867038]
[2024-11-11 21:21:19,266 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248867038] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 21:21:19,266 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 21:21:19,266 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-11 21:21:19,267 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364048492]
[2024-11-11 21:21:19,267 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 21:21:19,267 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-11 21:21:19,268 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 21:21:19,269 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-11 21:21:19,269 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-11 21:21:19,269 INFO  L87              Difference]: Start difference. First operand 14218 states and 23992 transitions. Second operand  has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 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 21:21:19,670 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 21:21:19,671 INFO  L93              Difference]: Finished difference Result 41854 states and 70969 transitions.
[2024-11-11 21:21:19,671 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-11 21:21:19,672 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 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 138
[2024-11-11 21:21:19,672 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 21:21:19,738 INFO  L225             Difference]: With dead ends: 41854
[2024-11-11 21:21:19,739 INFO  L226             Difference]: Without dead ends: 27978
[2024-11-11 21:21:19,766 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 21:21:19,767 INFO  L435           NwaCegarLoop]: 499 mSDtfsCounter, 547 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-11 21:21:19,767 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 1632 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-11 21:21:19,797 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 27978 states.
[2024-11-11 21:21:20,361 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 27978 to 21018.
[2024-11-11 21:21:20,436 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 21018 states, 21017 states have (on average 1.6862539848693914) internal successors, (35440), 21017 states have internal predecessors, (35440), 0 states have call successors, (0), 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 21:21:20,501 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21018 states to 21018 states and 35440 transitions.
[2024-11-11 21:21:20,502 INFO  L78                 Accepts]: Start accepts. Automaton has 21018 states and 35440 transitions. Word has length 138
[2024-11-11 21:21:20,503 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 21:21:20,503 INFO  L471      AbstractCegarLoop]: Abstraction has 21018 states and 35440 transitions.
[2024-11-11 21:21:20,503 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 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 21:21:20,504 INFO  L276                IsEmpty]: Start isEmpty. Operand 21018 states and 35440 transitions.
[2024-11-11 21:21:20,506 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 139
[2024-11-11 21:21:20,506 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 21:21:20,507 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:21:20,507 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-11-11 21:21:20,507 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 21:21:20,509 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 21:21:20,509 INFO  L85        PathProgramCache]: Analyzing trace with hash -1702546546, now seen corresponding path program 1 times
[2024-11-11 21:21:20,510 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 21:21:20,510 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334633559]
[2024-11-11 21:21:20,510 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 21:21:20,510 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 21:21:20,563 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 21:21:20,665 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 21:21:20,666 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 21:21:20,666 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334633559]
[2024-11-11 21:21:20,666 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334633559] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 21:21:20,666 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 21:21:20,666 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-11 21:21:20,667 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966167224]
[2024-11-11 21:21:20,667 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 21:21:20,667 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 21:21:20,667 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 21:21:20,668 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 21:21:20,669 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 21:21:20,669 INFO  L87              Difference]: Start difference. First operand 21018 states and 35440 transitions. Second operand  has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 21:21:21,198 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 21:21:21,198 INFO  L93              Difference]: Finished difference Result 47048 states and 79314 transitions.
[2024-11-11 21:21:21,199 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 21:21:21,200 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 138
[2024-11-11 21:21:21,200 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 21:21:21,280 INFO  L225             Difference]: With dead ends: 47048
[2024-11-11 21:21:21,281 INFO  L226             Difference]: Without dead ends: 32318
[2024-11-11 21:21:21,312 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 21:21:21,313 INFO  L435           NwaCegarLoop]: 620 mSDtfsCounter, 160 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-11 21:21:21,314 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1096 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-11 21:21:21,341 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 32318 states.
[2024-11-11 21:21:21,934 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 32318 to 32316.
[2024-11-11 21:21:21,989 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 32316 states, 32315 states have (on average 1.6757542936716694) internal successors, (54152), 32315 states have internal predecessors, (54152), 0 states have call successors, (0), 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 21:21:22,073 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 32316 states to 32316 states and 54152 transitions.
[2024-11-11 21:21:22,075 INFO  L78                 Accepts]: Start accepts. Automaton has 32316 states and 54152 transitions. Word has length 138
[2024-11-11 21:21:22,075 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 21:21:22,075 INFO  L471      AbstractCegarLoop]: Abstraction has 32316 states and 54152 transitions.
[2024-11-11 21:21:22,076 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 21:21:22,076 INFO  L276                IsEmpty]: Start isEmpty. Operand 32316 states and 54152 transitions.
[2024-11-11 21:21:22,078 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 139
[2024-11-11 21:21:22,078 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 21:21:22,078 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:21:22,078 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-11-11 21:21:22,079 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 21:21:22,080 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 21:21:22,080 INFO  L85        PathProgramCache]: Analyzing trace with hash 1122229290, now seen corresponding path program 1 times
[2024-11-11 21:21:22,080 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 21:21:22,080 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970652576]
[2024-11-11 21:21:22,080 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 21:21:22,081 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 21:21:22,244 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 21:21:22,322 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 21:21:22,322 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 21:21:22,322 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970652576]
[2024-11-11 21:21:22,323 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970652576] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 21:21:22,323 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 21:21:22,323 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-11 21:21:22,323 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648633945]
[2024-11-11 21:21:22,323 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 21:21:22,324 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 21:21:22,324 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 21:21:22,324 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 21:21:22,325 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 21:21:22,325 INFO  L87              Difference]: Start difference. First operand 32316 states and 54152 transitions. Second operand  has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 21:21:22,975 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 21:21:22,975 INFO  L93              Difference]: Finished difference Result 73000 states and 122814 transitions.
[2024-11-11 21:21:22,975 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 21:21:22,976 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 138
[2024-11-11 21:21:22,976 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 21:21:23,111 INFO  L225             Difference]: With dead ends: 73000
[2024-11-11 21:21:23,112 INFO  L226             Difference]: Without dead ends: 49854
[2024-11-11 21:21:23,152 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 21:21:23,153 INFO  L435           NwaCegarLoop]: 649 mSDtfsCounter, 167 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-11 21:21:23,153 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 1124 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-11 21:21:23,192 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 49854 states.
[2024-11-11 21:21:24,243 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 49854 to 49852.
[2024-11-11 21:21:24,313 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 49852 states, 49851 states have (on average 1.668552285811719) internal successors, (83179), 49851 states have internal predecessors, (83179), 0 states have call successors, (0), 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 21:21:24,610 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 49852 states to 49852 states and 83179 transitions.
[2024-11-11 21:21:24,612 INFO  L78                 Accepts]: Start accepts. Automaton has 49852 states and 83179 transitions. Word has length 138
[2024-11-11 21:21:24,616 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 21:21:24,616 INFO  L471      AbstractCegarLoop]: Abstraction has 49852 states and 83179 transitions.
[2024-11-11 21:21:24,617 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 21:21:24,617 INFO  L276                IsEmpty]: Start isEmpty. Operand 49852 states and 83179 transitions.
[2024-11-11 21:21:24,618 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 140
[2024-11-11 21:21:24,618 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 21:21:24,618 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:21:24,618 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-11-11 21:21:24,619 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 21:21:24,619 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 21:21:24,619 INFO  L85        PathProgramCache]: Analyzing trace with hash 1736329343, now seen corresponding path program 1 times
[2024-11-11 21:21:24,623 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 21:21:24,623 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645424348]
[2024-11-11 21:21:24,623 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 21:21:24,623 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 21:21:24,676 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 21:21:24,860 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 21:21:24,861 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 21:21:24,861 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645424348]
[2024-11-11 21:21:24,861 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645424348] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 21:21:24,861 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 21:21:24,862 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-11 21:21:24,862 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449628453]
[2024-11-11 21:21:24,862 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 21:21:24,862 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 21:21:24,863 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 21:21:24,863 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 21:21:24,863 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 21:21:24,864 INFO  L87              Difference]: Start difference. First operand 49852 states and 83179 transitions. Second operand  has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 21:21:25,879 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 21:21:25,879 INFO  L93              Difference]: Finished difference Result 110770 states and 184710 transitions.
[2024-11-11 21:21:25,880 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 21:21:25,880 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 139
[2024-11-11 21:21:25,881 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 21:21:26,267 INFO  L225             Difference]: With dead ends: 110770
[2024-11-11 21:21:26,267 INFO  L226             Difference]: Without dead ends: 75460
[2024-11-11 21:21:26,318 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 21:21:26,319 INFO  L435           NwaCegarLoop]: 607 mSDtfsCounter, 144 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-11 21:21:26,319 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1085 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-11 21:21:26,377 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 75460 states.
[2024-11-11 21:21:27,881 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 75460 to 75458.
[2024-11-11 21:21:27,993 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 75458 states, 75457 states have (on average 1.6527691267874418) internal successors, (124713), 75457 states have internal predecessors, (124713), 0 states have call successors, (0), 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 21:21:28,551 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 75458 states to 75458 states and 124713 transitions.
[2024-11-11 21:21:28,555 INFO  L78                 Accepts]: Start accepts. Automaton has 75458 states and 124713 transitions. Word has length 139
[2024-11-11 21:21:28,556 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 21:21:28,556 INFO  L471      AbstractCegarLoop]: Abstraction has 75458 states and 124713 transitions.
[2024-11-11 21:21:28,556 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 21:21:28,557 INFO  L276                IsEmpty]: Start isEmpty. Operand 75458 states and 124713 transitions.
[2024-11-11 21:21:28,559 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 141
[2024-11-11 21:21:28,560 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 21:21:28,560 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:21:28,560 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-11-11 21:21:28,561 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 21:21:28,561 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 21:21:28,561 INFO  L85        PathProgramCache]: Analyzing trace with hash -1306020350, now seen corresponding path program 1 times
[2024-11-11 21:21:28,562 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 21:21:28,562 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297482672]
[2024-11-11 21:21:28,562 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 21:21:28,562 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 21:21:28,609 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 21:21:28,974 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 21:21:28,974 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 21:21:28,975 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297482672]
[2024-11-11 21:21:28,976 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297482672] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 21:21:28,976 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 21:21:28,977 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-11 21:21:28,977 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085971733]
[2024-11-11 21:21:28,977 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 21:21:28,977 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-11 21:21:28,978 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 21:21:28,978 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-11 21:21:28,979 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-11-11 21:21:28,979 INFO  L87              Difference]: Start difference. First operand 75458 states and 124713 transitions. Second operand  has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 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 21:21:30,460 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 21:21:30,464 INFO  L93              Difference]: Finished difference Result 150690 states and 249061 transitions.
[2024-11-11 21:21:30,468 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-11 21:21:30,469 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 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 140
[2024-11-11 21:21:30,469 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 21:21:30,670 INFO  L225             Difference]: With dead ends: 150690
[2024-11-11 21:21:30,670 INFO  L226             Difference]: Without dead ends: 75460
[2024-11-11 21:21:30,733 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-11-11 21:21:30,734 INFO  L435           NwaCegarLoop]: 505 mSDtfsCounter, 450 mSDsluCounter, 1401 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-11 21:21:30,734 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 1906 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-11 21:21:30,798 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 75460 states.
[2024-11-11 21:21:32,377 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 75460 to 75458.
[2024-11-11 21:21:32,470 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 75458 states, 75457 states have (on average 1.6444862636998556) internal successors, (124088), 75457 states have internal predecessors, (124088), 0 states have call successors, (0), 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 21:21:33,006 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 75458 states to 75458 states and 124088 transitions.
[2024-11-11 21:21:33,010 INFO  L78                 Accepts]: Start accepts. Automaton has 75458 states and 124088 transitions. Word has length 140
[2024-11-11 21:21:33,011 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 21:21:33,011 INFO  L471      AbstractCegarLoop]: Abstraction has 75458 states and 124088 transitions.
[2024-11-11 21:21:33,011 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 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 21:21:33,012 INFO  L276                IsEmpty]: Start isEmpty. Operand 75458 states and 124088 transitions.
[2024-11-11 21:21:33,013 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 144
[2024-11-11 21:21:33,013 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 21:21:33,013 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:21:33,013 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-11-11 21:21:33,014 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 21:21:33,014 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 21:21:33,014 INFO  L85        PathProgramCache]: Analyzing trace with hash -590810265, now seen corresponding path program 1 times
[2024-11-11 21:21:33,014 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 21:21:33,014 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716951057]
[2024-11-11 21:21:33,015 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 21:21:33,015 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 21:21:33,056 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 21:21:33,366 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 21:21:33,366 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 21:21:33,366 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716951057]
[2024-11-11 21:21:33,366 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716951057] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 21:21:33,366 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 21:21:33,366 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-11 21:21:33,367 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020760059]
[2024-11-11 21:21:33,367 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 21:21:33,367 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-11 21:21:33,367 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 21:21:33,368 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-11 21:21:33,368 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-11-11 21:21:33,368 INFO  L87              Difference]: Start difference. First operand 75458 states and 124088 transitions. Second operand  has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 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 21:21:35,065 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 21:21:35,065 INFO  L93              Difference]: Finished difference Result 220690 states and 363361 transitions.
[2024-11-11 21:21:35,065 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-11 21:21:35,066 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 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 143
[2024-11-11 21:21:35,066 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 21:21:35,340 INFO  L225             Difference]: With dead ends: 220690
[2024-11-11 21:21:35,340 INFO  L226             Difference]: Without dead ends: 145460
[2024-11-11 21:21:35,390 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-11-11 21:21:35,391 INFO  L435           NwaCegarLoop]: 495 mSDtfsCounter, 150 mSDsluCounter, 1892 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 2387 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-11 21:21:35,391 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 2387 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-11 21:21:35,526 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 145460 states.
[2024-11-11 21:21:38,025 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 145460 to 145458.
[2024-11-11 21:21:38,165 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 145458 states, 145457 states have (on average 1.6336168077163697) internal successors, (237621), 145457 states have internal predecessors, (237621), 0 states have call successors, (0), 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 21:21:39,036 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 145458 states to 145458 states and 237621 transitions.
[2024-11-11 21:21:39,044 INFO  L78                 Accepts]: Start accepts. Automaton has 145458 states and 237621 transitions. Word has length 143
[2024-11-11 21:21:39,045 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 21:21:39,045 INFO  L471      AbstractCegarLoop]: Abstraction has 145458 states and 237621 transitions.
[2024-11-11 21:21:39,045 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 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 21:21:39,046 INFO  L276                IsEmpty]: Start isEmpty. Operand 145458 states and 237621 transitions.
[2024-11-11 21:21:39,047 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 145
[2024-11-11 21:21:39,047 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 21:21:39,047 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:21:39,048 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-11-11 21:21:39,048 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 21:21:39,048 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 21:21:39,048 INFO  L85        PathProgramCache]: Analyzing trace with hash -1566594325, now seen corresponding path program 1 times
[2024-11-11 21:21:39,048 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 21:21:39,048 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44475723]
[2024-11-11 21:21:39,049 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 21:21:39,049 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 21:21:39,150 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 21:21:39,493 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 21:21:39,493 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 21:21:39,493 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44475723]
[2024-11-11 21:21:39,494 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44475723] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 21:21:39,494 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 21:21:39,494 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-11 21:21:39,494 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063645870]
[2024-11-11 21:21:39,494 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 21:21:39,494 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-11 21:21:39,495 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 21:21:39,495 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-11 21:21:39,495 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-11 21:21:39,495 INFO  L87              Difference]: Start difference. First operand 145458 states and 237621 transitions. Second operand  has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 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 21:21:40,751 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 21:21:40,752 INFO  L93              Difference]: Finished difference Result 151268 states and 245366 transitions.
[2024-11-11 21:21:40,752 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-11-11 21:21:40,752 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 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 144
[2024-11-11 21:21:40,753 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 21:21:40,983 INFO  L225             Difference]: With dead ends: 151268
[2024-11-11 21:21:40,984 INFO  L226             Difference]: Without dead ends: 151266
[2024-11-11 21:21:41,023 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-11 21:21:41,024 INFO  L435           NwaCegarLoop]: 504 mSDtfsCounter, 0 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2001 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-11 21:21:41,024 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2001 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-11 21:21:41,127 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 151266 states.
[2024-11-11 21:21:43,884 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 151266 to 151266.
[2024-11-11 21:21:44,008 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 151266 states, 151265 states have (on average 1.609109840346412) internal successors, (243402), 151265 states have internal predecessors, (243402), 0 states have call successors, (0), 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 21:21:44,327 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 151266 states to 151266 states and 243402 transitions.
[2024-11-11 21:21:44,335 INFO  L78                 Accepts]: Start accepts. Automaton has 151266 states and 243402 transitions. Word has length 144
[2024-11-11 21:21:44,335 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 21:21:44,336 INFO  L471      AbstractCegarLoop]: Abstraction has 151266 states and 243402 transitions.
[2024-11-11 21:21:44,336 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 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 21:21:44,336 INFO  L276                IsEmpty]: Start isEmpty. Operand 151266 states and 243402 transitions.
[2024-11-11 21:21:44,340 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 183
[2024-11-11 21:21:44,340 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 21:21:44,340 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:21:44,341 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-11-11 21:21:44,341 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 21:21:44,341 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 21:21:44,341 INFO  L85        PathProgramCache]: Analyzing trace with hash 404142113, now seen corresponding path program 1 times
[2024-11-11 21:21:44,341 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 21:21:44,341 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837676615]
[2024-11-11 21:21:44,342 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 21:21:44,342 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 21:21:44,378 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 21:21:44,588 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2024-11-11 21:21:44,588 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 21:21:44,589 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837676615]
[2024-11-11 21:21:44,589 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837676615] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 21:21:44,589 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 21:21:44,589 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-11 21:21:44,589 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239624149]
[2024-11-11 21:21:44,589 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 21:21:44,590 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-11 21:21:44,590 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 21:21:44,590 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-11 21:21:44,590 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-11 21:21:44,591 INFO  L87              Difference]: Start difference. First operand 151266 states and 243402 transitions. Second operand  has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 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 21:21:48,232 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 21:21:48,233 INFO  L93              Difference]: Finished difference Result 415594 states and 670531 transitions.
[2024-11-11 21:21:48,233 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-11 21:21:48,233 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 182
[2024-11-11 21:21:48,233 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 21:21:48,872 INFO  L225             Difference]: With dead ends: 415594
[2024-11-11 21:21:48,872 INFO  L226             Difference]: Without dead ends: 348492
[2024-11-11 21:21:48,972 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2024-11-11 21:21:48,972 INFO  L435           NwaCegarLoop]: 692 mSDtfsCounter, 1105 mSDsluCounter, 2170 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1105 SdHoareTripleChecker+Valid, 2862 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-11 21:21:48,973 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1105 Valid, 2862 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-11 21:21:49,205 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 348492 states.
[2024-11-11 21:21:54,057 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 348492 to 243780.
[2024-11-11 21:21:54,282 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 243780 states, 243779 states have (on average 1.6066027016272937) internal successors, (391656), 243779 states have internal predecessors, (391656), 0 states have call successors, (0), 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 21:21:55,499 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 243780 states to 243780 states and 391656 transitions.
[2024-11-11 21:21:55,510 INFO  L78                 Accepts]: Start accepts. Automaton has 243780 states and 391656 transitions. Word has length 182
[2024-11-11 21:21:55,511 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 21:21:55,511 INFO  L471      AbstractCegarLoop]: Abstraction has 243780 states and 391656 transitions.
[2024-11-11 21:21:55,511 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 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 21:21:55,511 INFO  L276                IsEmpty]: Start isEmpty. Operand 243780 states and 391656 transitions.
[2024-11-11 21:21:55,514 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 183
[2024-11-11 21:21:55,514 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 21:21:55,514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:21:55,515 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-11-11 21:21:55,515 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 21:21:55,515 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 21:21:55,515 INFO  L85        PathProgramCache]: Analyzing trace with hash -100120827, now seen corresponding path program 1 times
[2024-11-11 21:21:55,515 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 21:21:55,515 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920474648]
[2024-11-11 21:21:55,516 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 21:21:55,516 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 21:21:55,560 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 21:21:55,860 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2024-11-11 21:21:55,860 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 21:21:55,860 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920474648]
[2024-11-11 21:21:55,861 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920474648] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 21:21:55,861 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 21:21:55,861 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-11 21:21:55,861 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895950500]
[2024-11-11 21:21:55,861 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 21:21:55,861 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-11 21:21:55,861 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 21:21:55,862 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-11 21:21:55,862 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-11 21:21:55,862 INFO  L87              Difference]: Start difference. First operand 243780 states and 391656 transitions. Second operand  has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 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 21:21:59,641 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 21:21:59,641 INFO  L93              Difference]: Finished difference Result 458706 states and 740287 transitions.
[2024-11-11 21:21:59,642 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-11 21:21:59,642 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 182
[2024-11-11 21:21:59,642 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 21:22:00,453 INFO  L225             Difference]: With dead ends: 458706
[2024-11-11 21:22:00,453 INFO  L226             Difference]: Without dead ends: 391604
[2024-11-11 21:22:00,601 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2024-11-11 21:22:00,602 INFO  L435           NwaCegarLoop]: 694 mSDtfsCounter, 1195 mSDsluCounter, 2203 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1195 SdHoareTripleChecker+Valid, 2897 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-11 21:22:00,602 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1195 Valid, 2897 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-11 21:22:00,910 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 391604 states.