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


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


Checking for ERROR reachability
Using default analysis
Version 8be7027f
Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem01_label09.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 ffdda078a4af5cadd809285deda853e717921f28c9c08179af4d863a439eed59
--- Real Ultimate output ---
This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m
[2024-11-11 16:04:32,886 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-11 16:04:32,948 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-11 16:04:32,952 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-11 16:04:32,952 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-11 16:04:32,975 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-11 16:04:32,975 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-11 16:04:32,976 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-11 16:04:32,977 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-11 16:04:32,977 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-11 16:04:32,978 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-11 16:04:32,978 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-11 16:04:32,978 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-11 16:04:32,978 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-11 16:04:32,979 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-11 16:04:32,979 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-11 16:04:32,979 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-11 16:04:32,979 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-11 16:04:32,980 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-11 16:04:32,980 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-11 16:04:32,983 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-11 16:04:32,984 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-11 16:04:32,984 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-11 16:04:32,984 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-11 16:04:32,984 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-11 16:04:32,984 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-11 16:04:32,984 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-11 16:04:32,985 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-11 16:04:32,985 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-11 16:04:32,985 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-11 16:04:32,985 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-11 16:04:32,985 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-11 16:04:32,986 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-11 16:04:32,986 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-11 16:04:32,986 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-11 16:04:32,986 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-11 16:04:32,986 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-11 16:04:32,987 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-11 16:04:32,987 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-11 16:04:32,987 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-11 16:04:32,989 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-11 16:04:32,989 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-11 16:04:32,989 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 -> ffdda078a4af5cadd809285deda853e717921f28c9c08179af4d863a439eed59
[2024-11-11 16:04:33,184 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-11 16:04:33,206 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-11 16:04:33,208 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-11 16:04:33,209 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-11 16:04:33,209 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-11 16:04:33,210 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label09.c
[2024-11-11 16:04:34,384 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-11 16:04:34,582 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-11 16:04:34,583 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label09.c
[2024-11-11 16:04:34,594 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6daedd68c/ce18d884e6c94ef8b9b35a29ef371c16/FLAG1d7704555
[2024-11-11 16:04:34,607 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6daedd68c/ce18d884e6c94ef8b9b35a29ef371c16
[2024-11-11 16:04:34,609 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-11 16:04:34,611 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-11 16:04:34,612 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-11 16:04:34,612 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-11 16:04:34,617 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-11 16:04:34,617 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:04:34" (1/1) ...
[2024-11-11 16:04:34,618 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@179362f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:04:34, skipping insertion in model container
[2024-11-11 16:04:34,618 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:04:34" (1/1) ...
[2024-11-11 16:04:34,656 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-11 16:04:34,919 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label09.c[20223,20236]
[2024-11-11 16:04:34,945 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-11 16:04:34,953 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-11 16:04:35,050 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label09.c[20223,20236]
[2024-11-11 16:04:35,060 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-11 16:04:35,074 INFO  L204         MainTranslator]: Completed translation
[2024-11-11 16:04:35,075 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:04:35 WrapperNode
[2024-11-11 16:04:35,075 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-11 16:04:35,076 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-11 16:04:35,076 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-11 16:04:35,076 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-11 16:04:35,080 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:04:35" (1/1) ...
[2024-11-11 16:04:35,092 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:04:35" (1/1) ...
[2024-11-11 16:04:35,127 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 658
[2024-11-11 16:04:35,128 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-11 16:04:35,128 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-11 16:04:35,129 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-11 16:04:35,129 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-11 16:04:35,139 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:04:35" (1/1) ...
[2024-11-11 16:04:35,139 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:04:35" (1/1) ...
[2024-11-11 16:04:35,143 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:04:35" (1/1) ...
[2024-11-11 16:04:35,163 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-11 16:04:35,164 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:04:35" (1/1) ...
[2024-11-11 16:04:35,164 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:04:35" (1/1) ...
[2024-11-11 16:04:35,177 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:04:35" (1/1) ...
[2024-11-11 16:04:35,182 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:04:35" (1/1) ...
[2024-11-11 16:04:35,186 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:04:35" (1/1) ...
[2024-11-11 16:04:35,189 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:04:35" (1/1) ...
[2024-11-11 16:04:35,198 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-11 16:04:35,198 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-11 16:04:35,198 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-11 16:04:35,199 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-11 16:04:35,199 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:04:35" (1/1) ...
[2024-11-11 16:04:35,208 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-11 16:04:35,217 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-11 16:04:35,230 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-11 16:04:35,233 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-11 16:04:35,268 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-11 16:04:35,269 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-11 16:04:35,270 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-11 16:04:35,270 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-11 16:04:35,331 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-11 16:04:35,333 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-11 16:04:36,051 INFO  L?                        ?]: Removed 75 outVars from TransFormulas that were not future-live.
[2024-11-11 16:04:36,052 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-11 16:04:36,068 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-11 16:04:36,068 INFO  L316             CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-11 16:04:36,068 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:04:36 BoogieIcfgContainer
[2024-11-11 16:04:36,068 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-11 16:04:36,070 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-11 16:04:36,070 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-11 16:04:36,072 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-11 16:04:36,072 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 04:04:34" (1/3) ...
[2024-11-11 16:04:36,076 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ffb5634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:04:36, skipping insertion in model container
[2024-11-11 16:04:36,076 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:04:35" (2/3) ...
[2024-11-11 16:04:36,076 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ffb5634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:04:36, skipping insertion in model container
[2024-11-11 16:04:36,076 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:04:36" (3/3) ...
[2024-11-11 16:04:36,077 INFO  L112   eAbstractionObserver]: Analyzing ICFG Problem01_label09.c
[2024-11-11 16:04:36,089 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-11 16:04:36,090 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-11 16:04:36,143 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-11 16:04:36,147 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;@77e29417, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-11 16:04:36,147 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-11 16:04:36,152 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:36,159 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 119
[2024-11-11 16:04:36,160 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 16:04:36,160 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]
[2024-11-11 16:04:36,160 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 16:04:36,164 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 16:04:36,164 INFO  L85        PathProgramCache]: Analyzing trace with hash -286092569, now seen corresponding path program 1 times
[2024-11-11 16:04:36,171 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 16:04:36,171 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918787863]
[2024-11-11 16:04:36,171 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 16:04:36,172 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 16:04:36,337 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 16:04:36,583 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-11 16:04:36,583 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 16:04:36,584 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918787863]
[2024-11-11 16:04:36,584 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918787863] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 16:04:36,584 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 16:04:36,584 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-11 16:04:36,604 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250123877]
[2024-11-11 16:04:36,604 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 16:04:36,612 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 16:04:36,612 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 16:04:36,630 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 16:04:36,631 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 16:04:36,633 INFO  L87              Difference]: Start difference. First operand  has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:37,169 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 16:04:37,169 INFO  L93              Difference]: Finished difference Result 528 states and 915 transitions.
[2024-11-11 16:04:37,171 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 16:04:37,172 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 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 118
[2024-11-11 16:04:37,173 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 16:04:37,180 INFO  L225             Difference]: With dead ends: 528
[2024-11-11 16:04:37,180 INFO  L226             Difference]: Without dead ends: 266
[2024-11-11 16:04:37,183 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 16:04:37,185 INFO  L435           NwaCegarLoop]: 65 mSDtfsCounter, 64 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-11 16:04:37,185 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 73 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-11 16:04:37,198 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 266 states.
[2024-11-11 16:04:37,231 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266.
[2024-11-11 16:04:37,232 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 266 states, 265 states have (on average 1.411320754716981) internal successors, (374), 265 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:37,233 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 374 transitions.
[2024-11-11 16:04:37,234 INFO  L78                 Accepts]: Start accepts. Automaton has 266 states and 374 transitions. Word has length 118
[2024-11-11 16:04:37,234 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 16:04:37,234 INFO  L471      AbstractCegarLoop]: Abstraction has 266 states and 374 transitions.
[2024-11-11 16:04:37,234 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:37,234 INFO  L276                IsEmpty]: Start isEmpty. Operand 266 states and 374 transitions.
[2024-11-11 16:04:37,236 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 123
[2024-11-11 16:04:37,236 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 16:04:37,236 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2024-11-11 16:04:37,236 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-11 16:04:37,237 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 16:04:37,237 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 16:04:37,237 INFO  L85        PathProgramCache]: Analyzing trace with hash -674279649, now seen corresponding path program 1 times
[2024-11-11 16:04:37,237 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 16:04:37,237 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716167900]
[2024-11-11 16:04:37,237 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 16:04:37,237 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 16:04:37,278 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 16:04:37,403 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2024-11-11 16:04:37,404 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 16:04:37,404 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716167900]
[2024-11-11 16:04:37,404 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716167900] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 16:04:37,404 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 16:04:37,404 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-11 16:04:37,404 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491293967]
[2024-11-11 16:04:37,405 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 16:04:37,405 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 16:04:37,406 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 16:04:37,406 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 16:04:37,406 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 16:04:37,407 INFO  L87              Difference]: Start difference. First operand 266 states and 374 transitions. Second operand  has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:37,733 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 16:04:37,733 INFO  L93              Difference]: Finished difference Result 792 states and 1117 transitions.
[2024-11-11 16:04:37,733 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 16:04:37,734 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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 16:04:37,734 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 16:04:37,736 INFO  L225             Difference]: With dead ends: 792
[2024-11-11 16:04:37,736 INFO  L226             Difference]: Without dead ends: 528
[2024-11-11 16:04:37,737 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 16:04:37,738 INFO  L435           NwaCegarLoop]: 26 mSDtfsCounter, 36 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-11 16:04:37,739 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 31 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-11 16:04:37,740 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 528 states.
[2024-11-11 16:04:37,753 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528.
[2024-11-11 16:04:37,754 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 528 states, 527 states have (on average 1.3434535104364327) internal successors, (708), 527 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:37,755 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 708 transitions.
[2024-11-11 16:04:37,755 INFO  L78                 Accepts]: Start accepts. Automaton has 528 states and 708 transitions. Word has length 122
[2024-11-11 16:04:37,755 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 16:04:37,755 INFO  L471      AbstractCegarLoop]: Abstraction has 528 states and 708 transitions.
[2024-11-11 16:04:37,756 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:37,756 INFO  L276                IsEmpty]: Start isEmpty. Operand 528 states and 708 transitions.
[2024-11-11 16:04:37,758 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 153
[2024-11-11 16:04:37,758 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 16:04:37,758 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-11 16:04:37,758 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-11 16:04:37,758 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 16:04:37,759 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 16:04:37,759 INFO  L85        PathProgramCache]: Analyzing trace with hash -373823531, now seen corresponding path program 1 times
[2024-11-11 16:04:37,759 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 16:04:37,759 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106281671]
[2024-11-11 16:04:37,759 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 16:04:37,759 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 16:04:37,792 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 16:04:37,898 INFO  L134       CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2024-11-11 16:04:37,899 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 16:04:37,899 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106281671]
[2024-11-11 16:04:37,899 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106281671] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 16:04:37,900 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 16:04:37,900 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-11 16:04:37,900 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717842318]
[2024-11-11 16:04:37,900 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 16:04:37,901 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 16:04:37,902 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 16:04:37,902 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 16:04:37,903 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 16:04:37,904 INFO  L87              Difference]: Start difference. First operand 528 states and 708 transitions. Second operand  has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:38,240 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 16:04:38,240 INFO  L93              Difference]: Finished difference Result 1316 states and 1785 transitions.
[2024-11-11 16:04:38,240 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 16:04:38,241 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 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 152
[2024-11-11 16:04:38,241 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 16:04:38,243 INFO  L225             Difference]: With dead ends: 1316
[2024-11-11 16:04:38,244 INFO  L226             Difference]: Without dead ends: 790
[2024-11-11 16:04:38,245 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 16:04:38,246 INFO  L435           NwaCegarLoop]: 26 mSDtfsCounter, 147 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-11 16:04:38,246 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 30 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-11 16:04:38,248 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 790 states.
[2024-11-11 16:04:38,264 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 659.
[2024-11-11 16:04:38,265 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 659 states, 658 states have (on average 1.3495440729483283) internal successors, (888), 658 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:38,266 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 888 transitions.
[2024-11-11 16:04:38,266 INFO  L78                 Accepts]: Start accepts. Automaton has 659 states and 888 transitions. Word has length 152
[2024-11-11 16:04:38,267 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 16:04:38,267 INFO  L471      AbstractCegarLoop]: Abstraction has 659 states and 888 transitions.
[2024-11-11 16:04:38,270 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:38,270 INFO  L276                IsEmpty]: Start isEmpty. Operand 659 states and 888 transitions.
[2024-11-11 16:04:38,272 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 157
[2024-11-11 16:04:38,272 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 16:04:38,272 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-11 16:04:38,273 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-11 16:04:38,273 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 16:04:38,273 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 16:04:38,273 INFO  L85        PathProgramCache]: Analyzing trace with hash -247291617, now seen corresponding path program 1 times
[2024-11-11 16:04:38,273 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 16:04:38,274 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439863766]
[2024-11-11 16:04:38,274 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 16:04:38,274 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 16:04:38,303 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 16:04:38,464 INFO  L134       CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked.
[2024-11-11 16:04:38,464 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 16:04:38,464 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439863766]
[2024-11-11 16:04:38,464 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439863766] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 16:04:38,465 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 16:04:38,465 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-11 16:04:38,465 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550897837]
[2024-11-11 16:04:38,465 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 16:04:38,465 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 16:04:38,465 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 16:04:38,466 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 16:04:38,466 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 16:04:38,466 INFO  L87              Difference]: Start difference. First operand 659 states and 888 transitions. Second operand  has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:38,758 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 16:04:38,758 INFO  L93              Difference]: Finished difference Result 1316 states and 1774 transitions.
[2024-11-11 16:04:38,758 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 16:04:38,758 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156
[2024-11-11 16:04:38,759 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 16:04:38,760 INFO  L225             Difference]: With dead ends: 1316
[2024-11-11 16:04:38,760 INFO  L226             Difference]: Without dead ends: 659
[2024-11-11 16:04:38,761 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 16:04:38,762 INFO  L435           NwaCegarLoop]: 57 mSDtfsCounter, 132 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-11 16:04:38,762 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 62 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-11 16:04:38,763 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 659 states.
[2024-11-11 16:04:38,769 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659.
[2024-11-11 16:04:38,770 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 659 states, 658 states have (on average 1.3404255319148937) internal successors, (882), 658 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:38,771 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 882 transitions.
[2024-11-11 16:04:38,772 INFO  L78                 Accepts]: Start accepts. Automaton has 659 states and 882 transitions. Word has length 156
[2024-11-11 16:04:38,772 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 16:04:38,772 INFO  L471      AbstractCegarLoop]: Abstraction has 659 states and 882 transitions.
[2024-11-11 16:04:38,772 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:38,772 INFO  L276                IsEmpty]: Start isEmpty. Operand 659 states and 882 transitions.
[2024-11-11 16:04:38,773 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 161
[2024-11-11 16:04:38,773 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 16:04:38,774 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-11 16:04:38,774 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-11 16:04:38,774 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 16:04:38,774 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 16:04:38,774 INFO  L85        PathProgramCache]: Analyzing trace with hash 48788311, now seen corresponding path program 1 times
[2024-11-11 16:04:38,775 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 16:04:38,775 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959222227]
[2024-11-11 16:04:38,775 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 16:04:38,775 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 16:04:38,796 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 16:04:38,897 INFO  L134       CoverageAnalysis]: Checked inductivity of 58 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked.
[2024-11-11 16:04:38,897 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 16:04:38,897 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959222227]
[2024-11-11 16:04:38,897 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959222227] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 16:04:38,898 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 16:04:38,898 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-11 16:04:38,898 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502366217]
[2024-11-11 16:04:38,898 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 16:04:38,898 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 16:04:38,898 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 16:04:38,899 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 16:04:38,899 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 16:04:38,899 INFO  L87              Difference]: Start difference. First operand 659 states and 882 transitions. Second operand  has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:39,206 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 16:04:39,207 INFO  L93              Difference]: Finished difference Result 1578 states and 2090 transitions.
[2024-11-11 16:04:39,207 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 16:04:39,207 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160
[2024-11-11 16:04:39,207 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 16:04:39,209 INFO  L225             Difference]: With dead ends: 1578
[2024-11-11 16:04:39,209 INFO  L226             Difference]: Without dead ends: 921
[2024-11-11 16:04:39,210 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 16:04:39,211 INFO  L435           NwaCegarLoop]: 50 mSDtfsCounter, 134 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-11 16:04:39,211 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 55 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-11 16:04:39,212 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 921 states.
[2024-11-11 16:04:39,224 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 921.
[2024-11-11 16:04:39,225 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 921 states, 920 states have (on average 1.2826086956521738) internal successors, (1180), 920 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:39,227 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1180 transitions.
[2024-11-11 16:04:39,227 INFO  L78                 Accepts]: Start accepts. Automaton has 921 states and 1180 transitions. Word has length 160
[2024-11-11 16:04:39,227 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 16:04:39,227 INFO  L471      AbstractCegarLoop]: Abstraction has 921 states and 1180 transitions.
[2024-11-11 16:04:39,228 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:39,228 INFO  L276                IsEmpty]: Start isEmpty. Operand 921 states and 1180 transitions.
[2024-11-11 16:04:39,229 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 170
[2024-11-11 16:04:39,230 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 16:04:39,230 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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]
[2024-11-11 16:04:39,230 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-11 16:04:39,230 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 16:04:39,231 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 16:04:39,231 INFO  L85        PathProgramCache]: Analyzing trace with hash 574190645, now seen corresponding path program 1 times
[2024-11-11 16:04:39,231 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 16:04:39,231 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986101325]
[2024-11-11 16:04:39,232 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 16:04:39,232 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 16:04:39,256 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 16:04:39,332 INFO  L134       CoverageAnalysis]: Checked inductivity of 88 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked.
[2024-11-11 16:04:39,332 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 16:04:39,332 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986101325]
[2024-11-11 16:04:39,332 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986101325] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 16:04:39,332 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 16:04:39,332 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-11 16:04:39,332 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574201924]
[2024-11-11 16:04:39,332 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 16:04:39,333 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 16:04:39,333 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 16:04:39,333 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 16:04:39,333 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 16:04:39,333 INFO  L87              Difference]: Start difference. First operand 921 states and 1180 transitions. Second operand  has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:39,656 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 16:04:39,657 INFO  L93              Difference]: Finished difference Result 2495 states and 3157 transitions.
[2024-11-11 16:04:39,657 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 16:04:39,657 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 169
[2024-11-11 16:04:39,657 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 16:04:39,662 INFO  L225             Difference]: With dead ends: 2495
[2024-11-11 16:04:39,662 INFO  L226             Difference]: Without dead ends: 1576
[2024-11-11 16:04:39,663 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 16:04:39,665 INFO  L435           NwaCegarLoop]: 19 mSDtfsCounter, 137 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-11 16:04:39,666 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 23 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-11 16:04:39,669 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1576 states.
[2024-11-11 16:04:39,682 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1183.
[2024-11-11 16:04:39,683 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1183 states, 1182 states have (on average 1.260575296108291) internal successors, (1490), 1182 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:39,685 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1490 transitions.
[2024-11-11 16:04:39,690 INFO  L78                 Accepts]: Start accepts. Automaton has 1183 states and 1490 transitions. Word has length 169
[2024-11-11 16:04:39,690 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 16:04:39,690 INFO  L471      AbstractCegarLoop]: Abstraction has 1183 states and 1490 transitions.
[2024-11-11 16:04:39,691 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:39,691 INFO  L276                IsEmpty]: Start isEmpty. Operand 1183 states and 1490 transitions.
[2024-11-11 16:04:39,692 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 186
[2024-11-11 16:04:39,693 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 16:04:39,693 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2024-11-11 16:04:39,693 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-11 16:04:39,693 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 16:04:39,693 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 16:04:39,693 INFO  L85        PathProgramCache]: Analyzing trace with hash -1554483781, now seen corresponding path program 1 times
[2024-11-11 16:04:39,693 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 16:04:39,693 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366094268]
[2024-11-11 16:04:39,693 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 16:04:39,694 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 16:04:39,723 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 16:04:39,880 INFO  L134       CoverageAnalysis]: Checked inductivity of 113 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked.
[2024-11-11 16:04:39,880 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 16:04:39,880 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366094268]
[2024-11-11 16:04:39,880 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366094268] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 16:04:39,880 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 16:04:39,880 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-11 16:04:39,880 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070007909]
[2024-11-11 16:04:39,881 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 16:04:39,881 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 16:04:39,881 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 16:04:39,881 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 16:04:39,881 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 16:04:39,882 INFO  L87              Difference]: Start difference. First operand 1183 states and 1490 transitions. Second operand  has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:40,167 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 16:04:40,168 INFO  L93              Difference]: Finished difference Result 2495 states and 3151 transitions.
[2024-11-11 16:04:40,168 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 16:04:40,168 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 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 185
[2024-11-11 16:04:40,168 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 16:04:40,173 INFO  L225             Difference]: With dead ends: 2495
[2024-11-11 16:04:40,173 INFO  L226             Difference]: Without dead ends: 1314
[2024-11-11 16:04:40,174 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 16:04:40,176 INFO  L435           NwaCegarLoop]: 57 mSDtfsCounter, 108 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-11 16:04:40,176 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 62 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-11 16:04:40,178 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1314 states.
[2024-11-11 16:04:40,191 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1314.
[2024-11-11 16:04:40,192 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1314 states, 1313 states have (on average 1.2482863670982483) internal successors, (1639), 1313 states have internal predecessors, (1639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:40,194 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1639 transitions.
[2024-11-11 16:04:40,194 INFO  L78                 Accepts]: Start accepts. Automaton has 1314 states and 1639 transitions. Word has length 185
[2024-11-11 16:04:40,194 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 16:04:40,194 INFO  L471      AbstractCegarLoop]: Abstraction has 1314 states and 1639 transitions.
[2024-11-11 16:04:40,195 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:40,195 INFO  L276                IsEmpty]: Start isEmpty. Operand 1314 states and 1639 transitions.
[2024-11-11 16:04:40,197 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 202
[2024-11-11 16:04:40,197 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 16:04:40,197 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2024-11-11 16:04:40,197 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-11 16:04:40,197 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 16:04:40,197 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 16:04:40,197 INFO  L85        PathProgramCache]: Analyzing trace with hash -2096577307, now seen corresponding path program 1 times
[2024-11-11 16:04:40,198 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 16:04:40,198 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847900513]
[2024-11-11 16:04:40,198 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 16:04:40,198 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 16:04:40,237 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 16:04:40,424 INFO  L134       CoverageAnalysis]: Checked inductivity of 142 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked.
[2024-11-11 16:04:40,424 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 16:04:40,424 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847900513]
[2024-11-11 16:04:40,424 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847900513] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 16:04:40,424 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 16:04:40,424 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-11 16:04:40,424 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353260291]
[2024-11-11 16:04:40,424 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 16:04:40,425 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-11 16:04:40,425 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 16:04:40,425 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-11 16:04:40,425 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-11 16:04:40,425 INFO  L87              Difference]: Start difference. First operand 1314 states and 1639 transitions. Second operand  has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:40,925 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 16:04:40,925 INFO  L93              Difference]: Finished difference Result 3281 states and 4058 transitions.
[2024-11-11 16:04:40,926 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-11 16:04:40,926 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 201
[2024-11-11 16:04:40,926 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 16:04:40,930 INFO  L225             Difference]: With dead ends: 3281
[2024-11-11 16:04:40,931 INFO  L226             Difference]: Without dead ends: 1838
[2024-11-11 16:04:40,932 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-11 16:04:40,933 INFO  L435           NwaCegarLoop]: 30 mSDtfsCounter, 273 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-11 16:04:40,933 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 40 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-11 16:04:40,935 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1838 states.
[2024-11-11 16:04:40,950 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707.
[2024-11-11 16:04:40,952 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1707 states, 1706 states have (on average 1.1318874560375147) internal successors, (1931), 1706 states have internal predecessors, (1931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:40,954 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1931 transitions.
[2024-11-11 16:04:40,954 INFO  L78                 Accepts]: Start accepts. Automaton has 1707 states and 1931 transitions. Word has length 201
[2024-11-11 16:04:40,955 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 16:04:40,955 INFO  L471      AbstractCegarLoop]: Abstraction has 1707 states and 1931 transitions.
[2024-11-11 16:04:40,955 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:40,955 INFO  L276                IsEmpty]: Start isEmpty. Operand 1707 states and 1931 transitions.
[2024-11-11 16:04:40,958 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 225
[2024-11-11 16:04:40,958 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 16:04:40,958 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-11 16:04:40,958 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-11 16:04:40,958 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 16:04:40,959 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 16:04:40,959 INFO  L85        PathProgramCache]: Analyzing trace with hash -1130753447, now seen corresponding path program 1 times
[2024-11-11 16:04:40,959 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 16:04:40,959 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993969211]
[2024-11-11 16:04:40,959 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 16:04:40,959 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 16:04:40,996 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 16:04:41,139 INFO  L134       CoverageAnalysis]: Checked inductivity of 181 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked.
[2024-11-11 16:04:41,139 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 16:04:41,139 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993969211]
[2024-11-11 16:04:41,139 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993969211] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 16:04:41,139 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 16:04:41,139 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-11 16:04:41,140 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642909153]
[2024-11-11 16:04:41,140 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 16:04:41,140 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-11 16:04:41,140 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 16:04:41,141 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-11 16:04:41,141 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-11 16:04:41,141 INFO  L87              Difference]: Start difference. First operand 1707 states and 1931 transitions. Second operand  has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:41,596 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 16:04:41,596 INFO  L93              Difference]: Finished difference Result 3805 states and 4294 transitions.
[2024-11-11 16:04:41,600 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-11 16:04:41,600 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 224
[2024-11-11 16:04:41,600 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 16:04:41,605 INFO  L225             Difference]: With dead ends: 3805
[2024-11-11 16:04:41,605 INFO  L226             Difference]: Without dead ends: 2100
[2024-11-11 16:04:41,607 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-11 16:04:41,608 INFO  L435           NwaCegarLoop]: 17 mSDtfsCounter, 226 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-11 16:04:41,608 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 26 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-11 16:04:41,609 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2100 states.
[2024-11-11 16:04:41,644 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1707.
[2024-11-11 16:04:41,646 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1707 states, 1706 states have (on average 1.1072684642438453) internal successors, (1889), 1706 states have internal predecessors, (1889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:41,648 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1889 transitions.
[2024-11-11 16:04:41,649 INFO  L78                 Accepts]: Start accepts. Automaton has 1707 states and 1889 transitions. Word has length 224
[2024-11-11 16:04:41,649 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 16:04:41,650 INFO  L471      AbstractCegarLoop]: Abstraction has 1707 states and 1889 transitions.
[2024-11-11 16:04:41,650 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:41,650 INFO  L276                IsEmpty]: Start isEmpty. Operand 1707 states and 1889 transitions.
[2024-11-11 16:04:41,653 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 250
[2024-11-11 16:04:41,653 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 16:04:41,653 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2024-11-11 16:04:41,653 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-11 16:04:41,653 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 16:04:41,654 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 16:04:41,654 INFO  L85        PathProgramCache]: Analyzing trace with hash -319434376, now seen corresponding path program 1 times
[2024-11-11 16:04:41,654 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 16:04:41,654 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806010459]
[2024-11-11 16:04:41,654 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 16:04:41,654 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 16:04:41,682 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 16:04:41,838 INFO  L134       CoverageAnalysis]: Checked inductivity of 289 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked.
[2024-11-11 16:04:41,839 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 16:04:41,839 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806010459]
[2024-11-11 16:04:41,839 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806010459] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 16:04:41,839 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 16:04:41,839 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-11 16:04:41,839 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747761624]
[2024-11-11 16:04:41,839 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 16:04:41,840 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-11 16:04:41,840 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 16:04:41,840 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-11 16:04:41,840 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-11 16:04:41,841 INFO  L87              Difference]: Start difference. First operand 1707 states and 1889 transitions. Second operand  has 4 states, 4 states have (on average 35.25) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:42,254 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 16:04:42,254 INFO  L93              Difference]: Finished difference Result 3543 states and 3926 transitions.
[2024-11-11 16:04:42,254 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-11 16:04:42,255 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 35.25) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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 249
[2024-11-11 16:04:42,255 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 16:04:42,259 INFO  L225             Difference]: With dead ends: 3543
[2024-11-11 16:04:42,259 INFO  L226             Difference]: Without dead ends: 1838
[2024-11-11 16:04:42,260 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-11 16:04:42,261 INFO  L435           NwaCegarLoop]: 33 mSDtfsCounter, 372 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-11 16:04:42,261 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 42 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-11 16:04:42,262 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1838 states.
[2024-11-11 16:04:42,277 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838.
[2024-11-11 16:04:42,279 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1838 states, 1837 states have (on average 1.0974414806750137) internal successors, (2016), 1837 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:42,281 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2016 transitions.
[2024-11-11 16:04:42,281 INFO  L78                 Accepts]: Start accepts. Automaton has 1838 states and 2016 transitions. Word has length 249
[2024-11-11 16:04:42,281 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 16:04:42,281 INFO  L471      AbstractCegarLoop]: Abstraction has 1838 states and 2016 transitions.
[2024-11-11 16:04:42,282 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 35.25) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:42,282 INFO  L276                IsEmpty]: Start isEmpty. Operand 1838 states and 2016 transitions.
[2024-11-11 16:04:42,285 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 281
[2024-11-11 16:04:42,285 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 16:04:42,285 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-11 16:04:42,285 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-11 16:04:42,285 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 16:04:42,286 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 16:04:42,286 INFO  L85        PathProgramCache]: Analyzing trace with hash 462319416, now seen corresponding path program 1 times
[2024-11-11 16:04:42,286 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 16:04:42,286 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392550328]
[2024-11-11 16:04:42,286 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 16:04:42,286 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 16:04:42,317 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 16:04:42,407 INFO  L134       CoverageAnalysis]: Checked inductivity of 306 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked.
[2024-11-11 16:04:42,407 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 16:04:42,407 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392550328]
[2024-11-11 16:04:42,408 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392550328] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 16:04:42,408 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 16:04:42,408 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-11 16:04:42,408 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289801280]
[2024-11-11 16:04:42,408 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 16:04:42,408 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 16:04:42,408 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 16:04:42,409 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 16:04:42,409 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 16:04:42,409 INFO  L87              Difference]: Start difference. First operand 1838 states and 2016 transitions. Second operand  has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:42,688 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 16:04:42,688 INFO  L93              Difference]: Finished difference Result 4067 states and 4464 transitions.
[2024-11-11 16:04:42,688 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 16:04:42,689 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 280
[2024-11-11 16:04:42,689 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 16:04:42,694 INFO  L225             Difference]: With dead ends: 4067
[2024-11-11 16:04:42,694 INFO  L226             Difference]: Without dead ends: 2231
[2024-11-11 16:04:42,696 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-11 16:04:42,696 INFO  L435           NwaCegarLoop]: 173 mSDtfsCounter, 86 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-11 16:04:42,696 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 179 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-11 16:04:42,698 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2231 states.
[2024-11-11 16:04:42,742 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 2100.
[2024-11-11 16:04:42,744 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2100 states, 2099 states have (on average 1.0909957122439258) internal successors, (2290), 2099 states have internal predecessors, (2290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:42,747 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2290 transitions.
[2024-11-11 16:04:42,748 INFO  L78                 Accepts]: Start accepts. Automaton has 2100 states and 2290 transitions. Word has length 280
[2024-11-11 16:04:42,748 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 16:04:42,748 INFO  L471      AbstractCegarLoop]: Abstraction has 2100 states and 2290 transitions.
[2024-11-11 16:04:42,748 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:42,749 INFO  L276                IsEmpty]: Start isEmpty. Operand 2100 states and 2290 transitions.
[2024-11-11 16:04:42,753 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 303
[2024-11-11 16:04:42,754 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-11 16:04:42,754 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2024-11-11 16:04:42,754 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-11 16:04:42,754 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 16:04:42,755 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 16:04:42,755 INFO  L85        PathProgramCache]: Analyzing trace with hash -591222129, now seen corresponding path program 1 times
[2024-11-11 16:04:42,755 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 16:04:42,755 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493658334]
[2024-11-11 16:04:42,756 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 16:04:42,756 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 16:04:42,818 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 16:04:43,230 INFO  L134       CoverageAnalysis]: Checked inductivity of 360 backedges. 182 proven. 103 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked.
[2024-11-11 16:04:43,230 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 16:04:43,230 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493658334]
[2024-11-11 16:04:43,230 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493658334] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-11 16:04:43,230 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598586601]
[2024-11-11 16:04:43,230 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 16:04:43,231 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-11 16:04:43,231 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-11 16:04:43,232 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-11 16:04:43,233 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-11 16:04:43,346 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 16:04:43,349 INFO  L256         TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-11 16:04:43,360 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2024-11-11 16:04:43,523 INFO  L134       CoverageAnalysis]: Checked inductivity of 360 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked.
[2024-11-11 16:04:43,523 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-11 16:04:43,524 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [598586601] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 16:04:43,524 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-11 16:04:43,524 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2024-11-11 16:04:43,524 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392107097]
[2024-11-11 16:04:43,524 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 16:04:43,525 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-11 16:04:43,525 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 16:04:43,525 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-11 16:04:43,525 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-11-11 16:04:43,525 INFO  L87              Difference]: Start difference. First operand 2100 states and 2290 transitions. Second operand  has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:43,783 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 16:04:43,783 INFO  L93              Difference]: Finished difference Result 2493 states and 2699 transitions.
[2024-11-11 16:04:43,783 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-11 16:04:43,784 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 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 302
[2024-11-11 16:04:43,784 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 16:04:43,784 INFO  L225             Difference]: With dead ends: 2493
[2024-11-11 16:04:43,784 INFO  L226             Difference]: Without dead ends: 0
[2024-11-11 16:04:43,786 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-11-11 16:04:43,786 INFO  L435           NwaCegarLoop]: 23 mSDtfsCounter, 38 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-11 16:04:43,786 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 27 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-11 16:04:43,786 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2024-11-11 16:04:43,786 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2024-11-11 16:04:43,787 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:43,787 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2024-11-11 16:04:43,787 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 302
[2024-11-11 16:04:43,787 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-11 16:04:43,787 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2024-11-11 16:04:43,787 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 16:04:43,787 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2024-11-11 16:04:43,787 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2024-11-11 16:04:43,789 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-11 16:04:43,803 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-11 16:04:43,990 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2024-11-11 16:04:43,993 INFO  L421         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-11 16:04:43,995 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2024-11-11 16:04:44,076 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2024-11-11 16:04:44,090 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 04:04:44 BoogieIcfgContainer
[2024-11-11 16:04:44,090 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-11 16:04:44,091 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-11 16:04:44,091 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-11-11 16:04:44,091 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-11-11 16:04:44,091 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:04:36" (3/4) ...
[2024-11-11 16:04:44,093 INFO  L142         WitnessPrinter]: Generating witness for correct program
[2024-11-11 16:04:44,108 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges
[2024-11-11 16:04:44,109 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2024-11-11 16:04:44,109 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2024-11-11 16:04:44,110 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2024-11-11 16:04:44,214 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-11 16:04:44,214 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2024-11-11 16:04:44,214 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-11 16:04:44,214 INFO  L158              Benchmark]: Toolchain (without parser) took 9603.95ms. Allocated memory was 138.4MB in the beginning and 371.2MB in the end (delta: 232.8MB). Free memory was 64.3MB in the beginning and 267.0MB in the end (delta: -202.7MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB.
[2024-11-11 16:04:44,215 INFO  L158              Benchmark]: CDTParser took 0.14ms. Allocated memory is still 138.4MB. Free memory is still 88.9MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-11 16:04:44,215 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 462.82ms. Allocated memory was 138.4MB in the beginning and 197.1MB in the end (delta: 58.7MB). Free memory was 64.1MB in the beginning and 145.9MB in the end (delta: -81.8MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB.
[2024-11-11 16:04:44,215 INFO  L158              Benchmark]: Boogie Procedure Inliner took 52.40ms. Allocated memory is still 197.1MB. Free memory was 145.9MB in the beginning and 139.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
[2024-11-11 16:04:44,215 INFO  L158              Benchmark]: Boogie Preprocessor took 69.44ms. Allocated memory is still 197.1MB. Free memory was 139.6MB in the beginning and 134.5MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-11 16:04:44,215 INFO  L158              Benchmark]: RCFGBuilder took 870.13ms. Allocated memory is still 197.1MB. Free memory was 134.5MB in the beginning and 118.6MB in the end (delta: 15.9MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB.
[2024-11-11 16:04:44,215 INFO  L158              Benchmark]: TraceAbstraction took 8020.65ms. Allocated memory was 197.1MB in the beginning and 371.2MB in the end (delta: 174.1MB). Free memory was 118.6MB in the beginning and 279.6MB in the end (delta: -161.0MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB.
[2024-11-11 16:04:44,215 INFO  L158              Benchmark]: Witness Printer took 123.24ms. Allocated memory is still 371.2MB. Free memory was 279.6MB in the beginning and 267.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
[2024-11-11 16:04:44,216 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.14ms. Allocated memory is still 138.4MB. Free memory is still 88.9MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 462.82ms. Allocated memory was 138.4MB in the beginning and 197.1MB in the end (delta: 58.7MB). Free memory was 64.1MB in the beginning and 145.9MB in the end (delta: -81.8MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 52.40ms. Allocated memory is still 197.1MB. Free memory was 145.9MB in the beginning and 139.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 69.44ms. Allocated memory is still 197.1MB. Free memory was 139.6MB in the beginning and 134.5MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * RCFGBuilder took 870.13ms. Allocated memory is still 197.1MB. Free memory was 134.5MB in the beginning and 118.6MB in the end (delta: 15.9MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB.
 * TraceAbstraction took 8020.65ms. Allocated memory was 197.1MB in the beginning and 371.2MB in the end (delta: 174.1MB). Free memory was 118.6MB in the beginning and 279.6MB in the end (delta: -161.0MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB.
 * Witness Printer took 123.24ms. Allocated memory is still 371.2MB. Free memory was 279.6MB in the beginning and 267.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Line: 540]: a call to reach_error is unreachable
    For all program executions holds that a call to reach_error is unreachable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.9s, OverallIterations: 12, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1753 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1753 mSDsluCounter, 650 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 74 mSDsCounter, 853 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4574 IncrementalHoareTripleChecker+Invalid, 5427 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 853 mSolverCounterUnsat, 576 mSDtfsCounter, 4574 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 334 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2100occurred in iteration=11, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 1179 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 2620 NumberOfCodeBlocks, 2620 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2607 ConstructedInterpolants, 0 QuantifiedInterpolants, 6639 SizeOfPredicates, 0 NumberOfNonLiveVariables, 484 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 1883/1986 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
  - InvariantResult [Line: 593]: Loop Invariant
    Derived loop invariant: (((((((14 <= a8) && (a21 == 1)) && (a16 <= 5)) || ((a21 == 1) && (15 <= a8))) || ((a21 == 1) && (a16 <= 4))) || (a20 == 1)) || ((a17 == 1) && (a16 <= 5)))
RESULT: Ultimate proved your program to be correct!
[2024-11-11 16:04:44,239 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

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