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


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


Checking for ERROR reachability
Using default analysis
Version c7c6ca5d
Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem02_label00.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 2bca315e83f3e404b0e19c30f2a2a6ccd3138047241e2a3074cd921904dce242
--- Real Ultimate output ---
This is Ultimate 0.2.5-?-c7c6ca5-m
[2024-11-08 10:27:29,904 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-08 10:27:29,977 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-08 10:27:29,982 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 10:27:29,986 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 10:27:30,015 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 10:27:30,016 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 10:27:30,017 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 10:27:30,017 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 10:27:30,018 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-08 10:27:30,019 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 10:27:30,019 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 10:27:30,020 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 10:27:30,022 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-08 10:27:30,022 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-08 10:27:30,023 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 10:27:30,023 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-08 10:27:30,023 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-08 10:27:30,023 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-08 10:27:30,024 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-08 10:27:30,024 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-08 10:27:30,025 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-08 10:27:30,025 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 10:27:30,025 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-08 10:27:30,026 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-08 10:27:30,026 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-08 10:27:30,026 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-08 10:27:30,027 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-08 10:27:30,027 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 10:27:30,027 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-08 10:27:30,027 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 10:27:30,028 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-08 10:27:30,035 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 10:27:30,036 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 10:27:30,036 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 10:27:30,036 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-08 10:27:30,036 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-08 10:27:30,037 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-08 10:27:30,037 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 10:27:30,037 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 10:27:30,037 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 10:27:30,040 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 10:27:30,041 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 -> 2bca315e83f3e404b0e19c30f2a2a6ccd3138047241e2a3074cd921904dce242
[2024-11-08 10:27:30,326 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 10:27:30,351 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 10:27:30,355 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 10:27:30,356 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-08 10:27:30,356 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-08 10:27:30,357 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label00.c
[2024-11-08 10:27:31,814 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-08 10:27:32,141 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-08 10:27:32,141 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label00.c
[2024-11-08 10:27:32,164 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b0489c17/20a5c329ab7a45719ecd7e3d79bb964e/FLAGf871c8fcd
[2024-11-08 10:27:32,183 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b0489c17/20a5c329ab7a45719ecd7e3d79bb964e
[2024-11-08 10:27:32,186 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 10:27:32,187 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 10:27:32,188 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 10:27:32,188 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 10:27:32,194 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 10:27:32,195 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:27:32" (1/1) ...
[2024-11-08 10:27:32,196 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49506656 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:32, skipping insertion in model container
[2024-11-08 10:27:32,196 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:27:32" (1/1) ...
[2024-11-08 10:27:32,237 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-08 10:27:32,555 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label00.c[18487,18500]
[2024-11-08 10:27:32,607 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-08 10:27:32,616 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-08 10:27:32,704 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label00.c[18487,18500]
[2024-11-08 10:27:32,713 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-08 10:27:32,733 INFO  L204         MainTranslator]: Completed translation
[2024-11-08 10:27:32,733 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:32 WrapperNode
[2024-11-08 10:27:32,734 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 10:27:32,735 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 10:27:32,735 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 10:27:32,735 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 10:27:32,741 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:32" (1/1) ...
[2024-11-08 10:27:32,757 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:32" (1/1) ...
[2024-11-08 10:27:32,806 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669
[2024-11-08 10:27:32,806 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 10:27:32,811 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 10:27:32,811 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 10:27:32,811 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 10:27:32,823 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:32" (1/1) ...
[2024-11-08 10:27:32,824 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:32" (1/1) ...
[2024-11-08 10:27:32,827 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:32" (1/1) ...
[2024-11-08 10:27:32,849 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-08 10:27:32,849 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:32" (1/1) ...
[2024-11-08 10:27:32,849 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:32" (1/1) ...
[2024-11-08 10:27:32,864 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:32" (1/1) ...
[2024-11-08 10:27:32,871 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:32" (1/1) ...
[2024-11-08 10:27:32,876 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:32" (1/1) ...
[2024-11-08 10:27:32,880 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:32" (1/1) ...
[2024-11-08 10:27:32,893 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 10:27:32,898 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 10:27:32,898 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 10:27:32,898 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-08 10:27:32,899 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:32" (1/1) ...
[2024-11-08 10:27:32,905 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 10:27:32,915 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 10:27:32,933 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-08 10:27:32,936 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-08 10:27:32,985 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 10:27:32,985 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-08 10:27:32,986 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 10:27:32,986 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 10:27:33,064 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-08 10:27:33,067 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 10:27:34,117 INFO  L?                        ?]: Removed 84 outVars from TransFormulas that were not future-live.
[2024-11-08 10:27:34,117 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-08 10:27:34,140 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 10:27:34,141 INFO  L316             CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-08 10:27:34,141 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:27:34 BoogieIcfgContainer
[2024-11-08 10:27:34,142 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 10:27:34,143 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 10:27:34,143 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 10:27:34,147 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-08 10:27:34,147 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:27:32" (1/3) ...
[2024-11-08 10:27:34,148 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f66353 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:27:34, skipping insertion in model container
[2024-11-08 10:27:34,148 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:27:32" (2/3) ...
[2024-11-08 10:27:34,149 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f66353 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:27:34, skipping insertion in model container
[2024-11-08 10:27:34,149 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:27:34" (3/3) ...
[2024-11-08 10:27:34,150 INFO  L112   eAbstractionObserver]: Analyzing ICFG Problem02_label00.c
[2024-11-08 10:27:34,166 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 10:27:34,167 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-08 10:27:34,233 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 10:27:34,238 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;@40c88a19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 10:27:34,238 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-08 10:27:34,245 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:27:34,257 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 116
[2024-11-08 10:27:34,258 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 10:27:34,258 INFO  L215           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]
[2024-11-08 10:27:34,259 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 10:27:34,264 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 10:27:34,264 INFO  L85        PathProgramCache]: Analyzing trace with hash 1162953203, now seen corresponding path program 1 times
[2024-11-08 10:27:34,273 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 10:27:34,274 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910765864]
[2024-11-08 10:27:34,274 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 10:27:34,275 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 10:27:34,481 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 10:27:34,876 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-08 10:27:34,877 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 10:27:34,878 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910765864]
[2024-11-08 10:27:34,879 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910765864] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 10:27:34,880 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 10:27:34,880 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 10:27:34,882 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638478307]
[2024-11-08 10:27:34,882 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 10:27:34,887 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 10:27:34,891 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 10:27:34,920 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 10:27:34,921 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 10:27:34,925 INFO  L87              Difference]: Start difference. First operand  has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:27:35,681 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 10:27:35,685 INFO  L93              Difference]: Finished difference Result 630 states and 1070 transitions.
[2024-11-08 10:27:35,687 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 10:27:35,688 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115
[2024-11-08 10:27:35,692 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 10:27:35,702 INFO  L225             Difference]: With dead ends: 630
[2024-11-08 10:27:35,703 INFO  L226             Difference]: Without dead ends: 318
[2024-11-08 10:27:35,706 INFO  L431           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-08 10:27:35,709 INFO  L432           NwaCegarLoop]: 96 mSDtfsCounter, 115 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2024-11-08 10:27:35,710 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 119 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2024-11-08 10:27:35,728 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 318 states.
[2024-11-08 10:27:35,761 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318.
[2024-11-08 10:27:35,763 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 318 states, 317 states have (on average 1.473186119873817) internal successors, (467), 317 states have internal predecessors, (467), 0 states have call successors, (0), 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-08 10:27:35,764 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 467 transitions.
[2024-11-08 10:27:35,765 INFO  L78                 Accepts]: Start accepts. Automaton has 318 states and 467 transitions. Word has length 115
[2024-11-08 10:27:35,766 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 10:27:35,766 INFO  L471      AbstractCegarLoop]: Abstraction has 318 states and 467 transitions.
[2024-11-08 10:27:35,767 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:27:35,767 INFO  L276                IsEmpty]: Start isEmpty. Operand 318 states and 467 transitions.
[2024-11-08 10:27:35,769 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 120
[2024-11-08 10:27:35,770 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 10:27:35,770 INFO  L215           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]
[2024-11-08 10:27:35,770 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-08 10:27:35,771 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 10:27:35,771 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 10:27:35,772 INFO  L85        PathProgramCache]: Analyzing trace with hash 1399875752, now seen corresponding path program 1 times
[2024-11-08 10:27:35,772 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 10:27:35,772 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374526624]
[2024-11-08 10:27:35,772 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 10:27:35,773 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 10:27:35,839 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 10:27:36,251 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 10:27:36,252 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 10:27:36,252 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374526624]
[2024-11-08 10:27:36,253 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374526624] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 10:27:36,253 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 10:27:36,253 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 10:27:36,253 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525700443]
[2024-11-08 10:27:36,254 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 10:27:36,256 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 10:27:36,257 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 10:27:36,257 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 10:27:36,258 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-08 10:27:36,258 INFO  L87              Difference]: Start difference. First operand 318 states and 467 transitions. Second operand  has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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-08 10:27:37,009 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 10:27:37,010 INFO  L93              Difference]: Finished difference Result 999 states and 1508 transitions.
[2024-11-08 10:27:37,010 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-08 10:27:37,010 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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 119
[2024-11-08 10:27:37,011 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 10:27:37,014 INFO  L225             Difference]: With dead ends: 999
[2024-11-08 10:27:37,015 INFO  L226             Difference]: Without dead ends: 600
[2024-11-08 10:27:37,020 INFO  L431           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-08 10:27:37,021 INFO  L432           NwaCegarLoop]: 80 mSDtfsCounter, 170 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2024-11-08 10:27:37,021 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 114 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2024-11-08 10:27:37,023 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 600 states.
[2024-11-08 10:27:37,046 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600.
[2024-11-08 10:27:37,048 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 600 states, 599 states have (on average 1.357262103505843) internal successors, (813), 599 states have internal predecessors, (813), 0 states have call successors, (0), 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-08 10:27:37,050 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 813 transitions.
[2024-11-08 10:27:37,050 INFO  L78                 Accepts]: Start accepts. Automaton has 600 states and 813 transitions. Word has length 119
[2024-11-08 10:27:37,050 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 10:27:37,050 INFO  L471      AbstractCegarLoop]: Abstraction has 600 states and 813 transitions.
[2024-11-08 10:27:37,051 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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-08 10:27:37,051 INFO  L276                IsEmpty]: Start isEmpty. Operand 600 states and 813 transitions.
[2024-11-08 10:27:37,055 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 134
[2024-11-08 10:27:37,055 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 10:27:37,055 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 10:27:37,056 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-08 10:27:37,056 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 10:27:37,057 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 10:27:37,057 INFO  L85        PathProgramCache]: Analyzing trace with hash -1256805806, now seen corresponding path program 1 times
[2024-11-08 10:27:37,057 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 10:27:37,057 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390707292]
[2024-11-08 10:27:37,058 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 10:27:37,058 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 10:27:37,106 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 10:27:37,204 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 10:27:37,204 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 10:27:37,204 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390707292]
[2024-11-08 10:27:37,205 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390707292] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 10:27:37,205 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 10:27:37,205 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 10:27:37,205 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028216975]
[2024-11-08 10:27:37,206 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 10:27:37,206 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 10:27:37,206 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 10:27:37,207 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 10:27:37,207 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 10:27:37,208 INFO  L87              Difference]: Start difference. First operand 600 states and 813 transitions. Second operand  has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 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-08 10:27:37,653 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 10:27:37,654 INFO  L93              Difference]: Finished difference Result 1781 states and 2418 transitions.
[2024-11-08 10:27:37,654 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 10:27:37,654 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 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 133
[2024-11-08 10:27:37,654 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 10:27:37,659 INFO  L225             Difference]: With dead ends: 1781
[2024-11-08 10:27:37,659 INFO  L226             Difference]: Without dead ends: 1183
[2024-11-08 10:27:37,660 INFO  L431           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-08 10:27:37,662 INFO  L432           NwaCegarLoop]: 71 mSDtfsCounter, 158 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-08 10:27:37,662 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 99 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-08 10:27:37,665 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1183 states.
[2024-11-08 10:27:37,690 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1173.
[2024-11-08 10:27:37,692 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1173 states, 1172 states have (on average 1.3114334470989761) internal successors, (1537), 1172 states have internal predecessors, (1537), 0 states have call successors, (0), 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-08 10:27:37,696 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1537 transitions.
[2024-11-08 10:27:37,696 INFO  L78                 Accepts]: Start accepts. Automaton has 1173 states and 1537 transitions. Word has length 133
[2024-11-08 10:27:37,696 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 10:27:37,697 INFO  L471      AbstractCegarLoop]: Abstraction has 1173 states and 1537 transitions.
[2024-11-08 10:27:37,697 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 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-08 10:27:37,697 INFO  L276                IsEmpty]: Start isEmpty. Operand 1173 states and 1537 transitions.
[2024-11-08 10:27:37,700 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 140
[2024-11-08 10:27:37,701 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 10:27:37,701 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:27:37,702 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-08 10:27:37,702 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 10:27:37,703 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 10:27:37,706 INFO  L85        PathProgramCache]: Analyzing trace with hash -1707718495, now seen corresponding path program 1 times
[2024-11-08 10:27:37,707 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 10:27:37,707 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2671877]
[2024-11-08 10:27:37,707 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 10:27:37,707 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 10:27:37,738 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 10:27:37,850 INFO  L134       CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 10:27:37,851 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 10:27:37,851 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2671877]
[2024-11-08 10:27:37,851 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2671877] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 10:27:37,851 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 10:27:37,852 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 10:27:37,852 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745577678]
[2024-11-08 10:27:37,852 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 10:27:37,853 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 10:27:37,853 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 10:27:37,853 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 10:27:37,854 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 10:27:37,854 INFO  L87              Difference]: Start difference. First operand 1173 states and 1537 transitions. Second operand  has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:27:38,307 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 10:27:38,307 INFO  L93              Difference]: Finished difference Result 3329 states and 4387 transitions.
[2024-11-08 10:27:38,307 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 10:27:38,307 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139
[2024-11-08 10:27:38,308 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 10:27:38,314 INFO  L225             Difference]: With dead ends: 3329
[2024-11-08 10:27:38,315 INFO  L226             Difference]: Without dead ends: 2158
[2024-11-08 10:27:38,317 INFO  L431           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-08 10:27:38,318 INFO  L432           NwaCegarLoop]: 111 mSDtfsCounter, 125 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-08 10:27:38,319 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 128 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-08 10:27:38,328 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2158 states.
[2024-11-08 10:27:38,360 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158 to 2155.
[2024-11-08 10:27:38,364 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2155 states, 2154 states have (on average 1.200557103064067) internal successors, (2586), 2154 states have internal predecessors, (2586), 0 states have call successors, (0), 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-08 10:27:38,370 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 2155 states and 2586 transitions.
[2024-11-08 10:27:38,370 INFO  L78                 Accepts]: Start accepts. Automaton has 2155 states and 2586 transitions. Word has length 139
[2024-11-08 10:27:38,371 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 10:27:38,371 INFO  L471      AbstractCegarLoop]: Abstraction has 2155 states and 2586 transitions.
[2024-11-08 10:27:38,372 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:27:38,372 INFO  L276                IsEmpty]: Start isEmpty. Operand 2155 states and 2586 transitions.
[2024-11-08 10:27:38,375 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 143
[2024-11-08 10:27:38,376 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 10:27:38,376 INFO  L215           NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 10:27:38,376 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-08 10:27:38,376 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 10:27:38,377 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 10:27:38,377 INFO  L85        PathProgramCache]: Analyzing trace with hash -1795097999, now seen corresponding path program 1 times
[2024-11-08 10:27:38,377 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 10:27:38,377 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491524373]
[2024-11-08 10:27:38,377 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 10:27:38,377 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 10:27:38,410 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 10:27:38,598 INFO  L134       CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2024-11-08 10:27:38,598 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 10:27:38,598 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491524373]
[2024-11-08 10:27:38,599 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491524373] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 10:27:38,599 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 10:27:38,599 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 10:27:38,601 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113129018]
[2024-11-08 10:27:38,601 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 10:27:38,601 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 10:27:38,601 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 10:27:38,602 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 10:27:38,603 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 10:27:38,603 INFO  L87              Difference]: Start difference. First operand 2155 states and 2586 transitions. Second operand  has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:27:39,050 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 10:27:39,050 INFO  L93              Difference]: Finished difference Result 5304 states and 6429 transitions.
[2024-11-08 10:27:39,050 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 10:27:39,051 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142
[2024-11-08 10:27:39,051 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 10:27:39,061 INFO  L225             Difference]: With dead ends: 5304
[2024-11-08 10:27:39,061 INFO  L226             Difference]: Without dead ends: 2871
[2024-11-08 10:27:39,064 INFO  L431           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-08 10:27:39,065 INFO  L432           NwaCegarLoop]: 210 mSDtfsCounter, 46 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-08 10:27:39,065 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 227 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-08 10:27:39,068 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2871 states.
[2024-11-08 10:27:39,104 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2871 to 2856.
[2024-11-08 10:27:39,108 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2856 states, 2855 states have (on average 1.1929947460595447) internal successors, (3406), 2855 states have internal predecessors, (3406), 0 states have call successors, (0), 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-08 10:27:39,115 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2856 states and 3406 transitions.
[2024-11-08 10:27:39,115 INFO  L78                 Accepts]: Start accepts. Automaton has 2856 states and 3406 transitions. Word has length 142
[2024-11-08 10:27:39,116 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 10:27:39,116 INFO  L471      AbstractCegarLoop]: Abstraction has 2856 states and 3406 transitions.
[2024-11-08 10:27:39,116 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:27:39,116 INFO  L276                IsEmpty]: Start isEmpty. Operand 2856 states and 3406 transitions.
[2024-11-08 10:27:39,120 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 145
[2024-11-08 10:27:39,120 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 10:27:39,120 INFO  L215           NwaCegarLoop]: trace histogram [3, 3, 3, 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-08 10:27:39,121 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-08 10:27:39,121 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 10:27:39,121 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 10:27:39,121 INFO  L85        PathProgramCache]: Analyzing trace with hash 1868407990, now seen corresponding path program 1 times
[2024-11-08 10:27:39,122 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 10:27:39,122 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673084318]
[2024-11-08 10:27:39,122 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 10:27:39,122 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 10:27:39,146 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 10:27:39,217 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 10:27:39,217 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 10:27:39,218 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673084318]
[2024-11-08 10:27:39,218 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673084318] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 10:27:39,218 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 10:27:39,218 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 10:27:39,218 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034517721]
[2024-11-08 10:27:39,218 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 10:27:39,219 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 10:27:39,219 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 10:27:39,220 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 10:27:39,220 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 10:27:39,220 INFO  L87              Difference]: Start difference. First operand 2856 states and 3406 transitions. Second operand  has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:27:39,706 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 10:27:39,707 INFO  L93              Difference]: Finished difference Result 6832 states and 8219 transitions.
[2024-11-08 10:27:39,707 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 10:27:39,707 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144
[2024-11-08 10:27:39,707 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 10:27:39,721 INFO  L225             Difference]: With dead ends: 6832
[2024-11-08 10:27:39,722 INFO  L226             Difference]: Without dead ends: 3978
[2024-11-08 10:27:39,726 INFO  L431           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-08 10:27:39,727 INFO  L432           NwaCegarLoop]: 52 mSDtfsCounter, 159 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-08 10:27:39,728 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 59 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-08 10:27:39,734 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3978 states.
[2024-11-08 10:27:39,782 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3978 to 3832.
[2024-11-08 10:27:39,788 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3832 states, 3831 states have (on average 1.1934220830070477) internal successors, (4572), 3831 states have internal predecessors, (4572), 0 states have call successors, (0), 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-08 10:27:39,797 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3832 states to 3832 states and 4572 transitions.
[2024-11-08 10:27:39,798 INFO  L78                 Accepts]: Start accepts. Automaton has 3832 states and 4572 transitions. Word has length 144
[2024-11-08 10:27:39,798 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 10:27:39,798 INFO  L471      AbstractCegarLoop]: Abstraction has 3832 states and 4572 transitions.
[2024-11-08 10:27:39,798 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 10:27:39,798 INFO  L276                IsEmpty]: Start isEmpty. Operand 3832 states and 4572 transitions.
[2024-11-08 10:27:39,806 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 153
[2024-11-08 10:27:39,806 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 10:27:39,807 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 10:27:39,807 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-08 10:27:39,807 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 10:27:39,807 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 10:27:39,808 INFO  L85        PathProgramCache]: Analyzing trace with hash -648560139, now seen corresponding path program 1 times
[2024-11-08 10:27:39,808 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 10:27:39,808 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918390115]
[2024-11-08 10:27:39,808 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 10:27:39,808 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 10:27:39,843 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 10:27:39,897 INFO  L134       CoverageAnalysis]: Checked inductivity of 62 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2024-11-08 10:27:39,897 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 10:27:39,898 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918390115]
[2024-11-08 10:27:39,898 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918390115] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 10:27:39,898 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 10:27:39,898 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 10:27:39,898 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031370207]
[2024-11-08 10:27:39,898 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 10:27:39,899 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 10:27:39,899 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 10:27:39,899 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 10:27:39,899 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 10:27:39,900 INFO  L87              Difference]: Start difference. First operand 3832 states and 4572 transitions. Second operand  has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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-08 10:27:40,362 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 10:27:40,362 INFO  L93              Difference]: Finished difference Result 6802 states and 8157 transitions.
[2024-11-08 10:27:40,363 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 10:27:40,363 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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-08 10:27:40,363 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 10:27:40,371 INFO  L225             Difference]: With dead ends: 6802
[2024-11-08 10:27:40,371 INFO  L226             Difference]: Without dead ends: 2692
[2024-11-08 10:27:40,376 INFO  L431           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-08 10:27:40,377 INFO  L432           NwaCegarLoop]: 224 mSDtfsCounter, 148 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-08 10:27:40,378 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 243 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-08 10:27:40,383 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2692 states.
[2024-11-08 10:27:40,421 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2692 to 2412.
[2024-11-08 10:27:40,424 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2412 states, 2411 states have (on average 1.13023641642472) internal successors, (2725), 2411 states have internal predecessors, (2725), 0 states have call successors, (0), 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-08 10:27:40,430 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2412 states to 2412 states and 2725 transitions.
[2024-11-08 10:27:40,431 INFO  L78                 Accepts]: Start accepts. Automaton has 2412 states and 2725 transitions. Word has length 152
[2024-11-08 10:27:40,431 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 10:27:40,431 INFO  L471      AbstractCegarLoop]: Abstraction has 2412 states and 2725 transitions.
[2024-11-08 10:27:40,431 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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-08 10:27:40,432 INFO  L276                IsEmpty]: Start isEmpty. Operand 2412 states and 2725 transitions.
[2024-11-08 10:27:40,436 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 164
[2024-11-08 10:27:40,436 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 10:27:40,437 INFO  L215           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 10:27:40,437 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-08 10:27:40,437 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 10:27:40,438 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 10:27:40,438 INFO  L85        PathProgramCache]: Analyzing trace with hash -1508399235, now seen corresponding path program 1 times
[2024-11-08 10:27:40,438 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 10:27:40,438 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496016211]
[2024-11-08 10:27:40,438 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 10:27:40,439 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 10:27:40,478 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 10:27:40,556 INFO  L134       CoverageAnalysis]: Checked inductivity of 102 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2024-11-08 10:27:40,557 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 10:27:40,557 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496016211]
[2024-11-08 10:27:40,557 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496016211] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 10:27:40,557 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 10:27:40,557 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 10:27:40,557 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050581141]
[2024-11-08 10:27:40,557 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 10:27:40,558 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 10:27:40,558 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 10:27:40,559 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 10:27:40,559 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 10:27:40,559 INFO  L87              Difference]: Start difference. First operand 2412 states and 2725 transitions. Second operand  has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 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-08 10:27:40,967 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 10:27:40,968 INFO  L93              Difference]: Finished difference Result 5235 states and 5938 transitions.
[2024-11-08 10:27:40,968 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 10:27:40,968 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 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 163
[2024-11-08 10:27:40,969 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 10:27:40,974 INFO  L225             Difference]: With dead ends: 5235
[2024-11-08 10:27:40,974 INFO  L226             Difference]: Without dead ends: 1981
[2024-11-08 10:27:40,977 INFO  L431           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-08 10:27:40,978 INFO  L432           NwaCegarLoop]: 221 mSDtfsCounter, 133 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-08 10:27:40,979 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 238 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-08 10:27:40,982 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1981 states.
[2024-11-08 10:27:41,002 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1841.
[2024-11-08 10:27:41,005 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1841 states, 1840 states have (on average 1.107608695652174) internal successors, (2038), 1840 states have internal predecessors, (2038), 0 states have call successors, (0), 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-08 10:27:41,008 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2038 transitions.
[2024-11-08 10:27:41,008 INFO  L78                 Accepts]: Start accepts. Automaton has 1841 states and 2038 transitions. Word has length 163
[2024-11-08 10:27:41,008 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 10:27:41,008 INFO  L471      AbstractCegarLoop]: Abstraction has 1841 states and 2038 transitions.
[2024-11-08 10:27:41,009 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 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-08 10:27:41,009 INFO  L276                IsEmpty]: Start isEmpty. Operand 1841 states and 2038 transitions.
[2024-11-08 10:27:41,011 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 167
[2024-11-08 10:27:41,011 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 10:27:41,012 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:27:41,012 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-08 10:27:41,012 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 10:27:41,013 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 10:27:41,013 INFO  L85        PathProgramCache]: Analyzing trace with hash -490153640, now seen corresponding path program 1 times
[2024-11-08 10:27:41,013 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 10:27:41,013 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493521922]
[2024-11-08 10:27:41,013 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 10:27:41,013 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 10:27:41,039 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 10:27:41,127 INFO  L134       CoverageAnalysis]: Checked inductivity of 76 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2024-11-08 10:27:41,127 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 10:27:41,127 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493521922]
[2024-11-08 10:27:41,127 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493521922] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 10:27:41,127 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 10:27:41,127 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 10:27:41,128 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768230060]
[2024-11-08 10:27:41,128 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 10:27:41,128 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 10:27:41,128 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 10:27:41,129 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 10:27:41,129 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 10:27:41,129 INFO  L87              Difference]: Start difference. First operand 1841 states and 2038 transitions. Second operand  has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 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-08 10:27:41,499 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 10:27:41,499 INFO  L93              Difference]: Finished difference Result 3542 states and 3931 transitions.
[2024-11-08 10:27:41,500 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 10:27:41,500 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 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 166
[2024-11-08 10:27:41,500 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 10:27:41,505 INFO  L225             Difference]: With dead ends: 3542
[2024-11-08 10:27:41,506 INFO  L226             Difference]: Without dead ends: 1843
[2024-11-08 10:27:41,508 INFO  L431           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-08 10:27:41,509 INFO  L432           NwaCegarLoop]: 210 mSDtfsCounter, 112 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-08 10:27:41,509 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 223 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-08 10:27:41,511 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1843 states.
[2024-11-08 10:27:41,530 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1841.
[2024-11-08 10:27:41,532 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1841 states, 1840 states have (on average 1.0907608695652173) internal successors, (2007), 1840 states have internal predecessors, (2007), 0 states have call successors, (0), 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-08 10:27:41,535 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2007 transitions.
[2024-11-08 10:27:41,536 INFO  L78                 Accepts]: Start accepts. Automaton has 1841 states and 2007 transitions. Word has length 166
[2024-11-08 10:27:41,536 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 10:27:41,536 INFO  L471      AbstractCegarLoop]: Abstraction has 1841 states and 2007 transitions.
[2024-11-08 10:27:41,536 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 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-08 10:27:41,536 INFO  L276                IsEmpty]: Start isEmpty. Operand 1841 states and 2007 transitions.
[2024-11-08 10:27:41,540 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 188
[2024-11-08 10:27:41,540 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 10:27:41,540 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:27:41,540 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-08 10:27:41,540 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 10:27:41,541 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 10:27:41,541 INFO  L85        PathProgramCache]: Analyzing trace with hash -1595735306, now seen corresponding path program 1 times
[2024-11-08 10:27:41,541 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 10:27:41,541 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097294112]
[2024-11-08 10:27:41,541 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 10:27:41,541 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 10:27:41,568 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 10:27:41,651 INFO  L134       CoverageAnalysis]: Checked inductivity of 119 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2024-11-08 10:27:41,651 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 10:27:41,652 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097294112]
[2024-11-08 10:27:41,652 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097294112] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 10:27:41,652 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 10:27:41,652 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 10:27:41,652 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029445008]
[2024-11-08 10:27:41,652 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 10:27:41,652 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 10:27:41,652 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 10:27:41,653 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 10:27:41,653 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 10:27:41,653 INFO  L87              Difference]: Start difference. First operand 1841 states and 2007 transitions. Second operand  has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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-08 10:27:42,054 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 10:27:42,054 INFO  L93              Difference]: Finished difference Result 3963 states and 4376 transitions.
[2024-11-08 10:27:42,054 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 10:27:42,055 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 187
[2024-11-08 10:27:42,055 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 10:27:42,060 INFO  L225             Difference]: With dead ends: 3963
[2024-11-08 10:27:42,061 INFO  L226             Difference]: Without dead ends: 2122
[2024-11-08 10:27:42,063 INFO  L431           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-08 10:27:42,063 INFO  L432           NwaCegarLoop]: 179 mSDtfsCounter, 133 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-08 10:27:42,063 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 189 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-08 10:27:42,066 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2122 states.
[2024-11-08 10:27:42,084 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 1841.
[2024-11-08 10:27:42,087 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1841 states, 1840 states have (on average 1.0956521739130434) internal successors, (2016), 1840 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-08 10:27:42,090 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2016 transitions.
[2024-11-08 10:27:42,090 INFO  L78                 Accepts]: Start accepts. Automaton has 1841 states and 2016 transitions. Word has length 187
[2024-11-08 10:27:42,090 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 10:27:42,091 INFO  L471      AbstractCegarLoop]: Abstraction has 1841 states and 2016 transitions.
[2024-11-08 10:27:42,091 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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-08 10:27:42,091 INFO  L276                IsEmpty]: Start isEmpty. Operand 1841 states and 2016 transitions.
[2024-11-08 10:27:42,096 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 204
[2024-11-08 10:27:42,096 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 10:27:42,096 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 10:27:42,097 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-08 10:27:42,097 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 10:27:42,097 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 10:27:42,097 INFO  L85        PathProgramCache]: Analyzing trace with hash 167282596, now seen corresponding path program 1 times
[2024-11-08 10:27:42,098 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 10:27:42,098 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083187539]
[2024-11-08 10:27:42,098 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 10:27:42,098 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 10:27:42,134 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 10:27:42,231 INFO  L134       CoverageAnalysis]: Checked inductivity of 105 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2024-11-08 10:27:42,232 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 10:27:42,232 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083187539]
[2024-11-08 10:27:42,232 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083187539] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 10:27:42,232 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 10:27:42,232 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 10:27:42,233 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409696407]
[2024-11-08 10:27:42,233 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 10:27:42,233 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 10:27:42,233 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 10:27:42,234 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 10:27:42,234 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 10:27:42,234 INFO  L87              Difference]: Start difference. First operand 1841 states and 2016 transitions. Second operand  has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 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-08 10:27:42,607 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 10:27:42,610 INFO  L93              Difference]: Finished difference Result 3960 states and 4352 transitions.
[2024-11-08 10:27:42,610 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 10:27:42,611 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 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 203
[2024-11-08 10:27:42,611 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 10:27:42,616 INFO  L225             Difference]: With dead ends: 3960
[2024-11-08 10:27:42,616 INFO  L226             Difference]: Without dead ends: 1841
[2024-11-08 10:27:42,618 INFO  L431           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-08 10:27:42,619 INFO  L432           NwaCegarLoop]: 190 mSDtfsCounter, 82 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-08 10:27:42,619 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 201 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-08 10:27:42,621 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1841 states.
[2024-11-08 10:27:42,638 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1841.
[2024-11-08 10:27:42,640 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1841 states, 1840 states have (on average 1.0543478260869565) internal successors, (1940), 1840 states have internal predecessors, (1940), 0 states have call successors, (0), 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-08 10:27:42,643 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 1940 transitions.
[2024-11-08 10:27:42,643 INFO  L78                 Accepts]: Start accepts. Automaton has 1841 states and 1940 transitions. Word has length 203
[2024-11-08 10:27:42,644 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 10:27:42,644 INFO  L471      AbstractCegarLoop]: Abstraction has 1841 states and 1940 transitions.
[2024-11-08 10:27:42,644 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 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-08 10:27:42,644 INFO  L276                IsEmpty]: Start isEmpty. Operand 1841 states and 1940 transitions.
[2024-11-08 10:27:42,648 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 227
[2024-11-08 10:27:42,648 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 10:27:42,648 INFO  L215           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2024-11-08 10:27:42,649 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-08 10:27:42,649 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 10:27:42,649 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 10:27:42,649 INFO  L85        PathProgramCache]: Analyzing trace with hash 607033053, now seen corresponding path program 1 times
[2024-11-08 10:27:42,649 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 10:27:42,650 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612700708]
[2024-11-08 10:27:42,650 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 10:27:42,650 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 10:27:42,686 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 10:27:42,779 INFO  L134       CoverageAnalysis]: Checked inductivity of 195 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked.
[2024-11-08 10:27:42,779 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 10:27:42,779 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612700708]
[2024-11-08 10:27:42,779 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612700708] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 10:27:42,780 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 10:27:42,780 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 10:27:42,780 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474866004]
[2024-11-08 10:27:42,780 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 10:27:42,780 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 10:27:42,780 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 10:27:42,781 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 10:27:42,781 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 10:27:42,782 INFO  L87              Difference]: Start difference. First operand 1841 states and 1940 transitions. Second operand  has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 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-08 10:27:43,113 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 10:27:43,113 INFO  L93              Difference]: Finished difference Result 3540 states and 3726 transitions.
[2024-11-08 10:27:43,114 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 10:27:43,114 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 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 226
[2024-11-08 10:27:43,114 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 10:27:43,119 INFO  L225             Difference]: With dead ends: 3540
[2024-11-08 10:27:43,119 INFO  L226             Difference]: Without dead ends: 1700
[2024-11-08 10:27:43,122 INFO  L431           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-08 10:27:43,123 INFO  L432           NwaCegarLoop]: 35 mSDtfsCounter, 148 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-08 10:27:43,123 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 45 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-08 10:27:43,125 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1700 states.
[2024-11-08 10:27:43,141 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1700.
[2024-11-08 10:27:43,143 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1700 states, 1699 states have (on average 1.0441436138905238) internal successors, (1774), 1699 states have internal predecessors, (1774), 0 states have call successors, (0), 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-08 10:27:43,145 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 1774 transitions.
[2024-11-08 10:27:43,145 INFO  L78                 Accepts]: Start accepts. Automaton has 1700 states and 1774 transitions. Word has length 226
[2024-11-08 10:27:43,146 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 10:27:43,146 INFO  L471      AbstractCegarLoop]: Abstraction has 1700 states and 1774 transitions.
[2024-11-08 10:27:43,146 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 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-08 10:27:43,146 INFO  L276                IsEmpty]: Start isEmpty. Operand 1700 states and 1774 transitions.
[2024-11-08 10:27:43,150 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 246
[2024-11-08 10:27:43,150 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 10:27:43,150 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 10:27:43,151 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-11-08 10:27:43,151 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 10:27:43,151 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 10:27:43,151 INFO  L85        PathProgramCache]: Analyzing trace with hash -387145804, now seen corresponding path program 1 times
[2024-11-08 10:27:43,151 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 10:27:43,152 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550333891]
[2024-11-08 10:27:43,152 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 10:27:43,152 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 10:27:43,198 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 10:27:43,586 INFO  L134       CoverageAnalysis]: Checked inductivity of 194 backedges. 138 proven. 10 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked.
[2024-11-08 10:27:43,588 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 10:27:43,588 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550333891]
[2024-11-08 10:27:43,588 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550333891] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 10:27:43,589 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588047651]
[2024-11-08 10:27:43,589 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 10:27:43,589 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 10:27:43,589 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 10:27:43,591 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-08 10:27:43,593 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-08 10:27:43,733 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 10:27:43,737 INFO  L255         TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 10:27:43,752 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 10:27:44,130 INFO  L134       CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked.
[2024-11-08 10:27:44,131 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 10:27:44,131 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [588047651] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 10:27:44,131 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-08 10:27:44,131 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5
[2024-11-08 10:27:44,132 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837421515]
[2024-11-08 10:27:44,132 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 10:27:44,132 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 10:27:44,132 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 10:27:44,133 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 10:27:44,133 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2024-11-08 10:27:44,133 INFO  L87              Difference]: Start difference. First operand 1700 states and 1774 transitions. Second operand  has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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-08 10:27:44,303 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 10:27:44,303 INFO  L93              Difference]: Finished difference Result 1700 states and 1774 transitions.
[2024-11-08 10:27:44,303 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 10:27:44,304 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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 245
[2024-11-08 10:27:44,304 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 10:27:44,304 INFO  L225             Difference]: With dead ends: 1700
[2024-11-08 10:27:44,305 INFO  L226             Difference]: Without dead ends: 0
[2024-11-08 10:27:44,306 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2024-11-08 10:27:44,306 INFO  L432           NwaCegarLoop]: 19 mSDtfsCounter, 59 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-08 10:27:44,307 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 19 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-08 10:27:44,307 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2024-11-08 10:27:44,308 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2024-11-08 10:27:44,308 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-08 10:27:44,308 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2024-11-08 10:27:44,308 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 245
[2024-11-08 10:27:44,308 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 10:27:44,308 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2024-11-08 10:27:44,309 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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-08 10:27:44,309 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2024-11-08 10:27:44,309 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2024-11-08 10:27:44,312 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-08 10:27:44,330 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-08 10:27:44,516 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,SelfDestructingSolverStorable12
[2024-11-08 10:27:44,520 INFO  L407         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 10:27:44,523 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2024-11-08 10:27:44,931 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2024-11-08 10:27:44,955 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:27:44 BoogieIcfgContainer
[2024-11-08 10:27:44,955 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-08 10:27:44,956 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-08 10:27:44,956 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-11-08 10:27:44,956 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-11-08 10:27:44,956 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:27:34" (3/4) ...
[2024-11-08 10:27:44,960 INFO  L142         WitnessPrinter]: Generating witness for correct program
[2024-11-08 10:27:44,980 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges
[2024-11-08 10:27:44,981 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2024-11-08 10:27:44,982 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2024-11-08 10:27:44,983 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2024-11-08 10:27:45,139 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-08 10:27:45,140 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2024-11-08 10:27:45,140 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-08 10:27:45,140 INFO  L158              Benchmark]: Toolchain (without parser) took 12953.44ms. Allocated memory was 157.3MB in the beginning and 339.7MB in the end (delta: 182.5MB). Free memory was 125.1MB in the beginning and 239.4MB in the end (delta: -114.3MB). Peak memory consumption was 71.0MB. Max. memory is 16.1GB.
[2024-11-08 10:27:45,141 INFO  L158              Benchmark]: CDTParser took 0.21ms. Allocated memory is still 157.3MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 10:27:45,141 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 545.89ms. Allocated memory is still 157.3MB. Free memory was 125.1MB in the beginning and 96.3MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB.
[2024-11-08 10:27:45,141 INFO  L158              Benchmark]: Boogie Procedure Inliner took 75.48ms. Allocated memory is still 157.3MB. Free memory was 96.3MB in the beginning and 90.9MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
[2024-11-08 10:27:45,142 INFO  L158              Benchmark]: Boogie Preprocessor took 86.32ms. Allocated memory is still 157.3MB. Free memory was 90.9MB in the beginning and 85.4MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-08 10:27:45,142 INFO  L158              Benchmark]: RCFGBuilder took 1243.91ms. Allocated memory was 157.3MB in the beginning and 195.0MB in the end (delta: 37.7MB). Free memory was 85.4MB in the beginning and 151.0MB in the end (delta: -65.5MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB.
[2024-11-08 10:27:45,143 INFO  L158              Benchmark]: TraceAbstraction took 10812.02ms. Allocated memory was 195.0MB in the beginning and 339.7MB in the end (delta: 144.7MB). Free memory was 151.0MB in the beginning and 252.0MB in the end (delta: -101.0MB). Peak memory consumption was 195.7MB. Max. memory is 16.1GB.
[2024-11-08 10:27:45,143 INFO  L158              Benchmark]: Witness Printer took 184.07ms. Allocated memory is still 339.7MB. Free memory was 252.0MB in the beginning and 239.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
[2024-11-08 10:27:45,144 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.21ms. Allocated memory is still 157.3MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 545.89ms. Allocated memory is still 157.3MB. Free memory was 125.1MB in the beginning and 96.3MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 75.48ms. Allocated memory is still 157.3MB. Free memory was 96.3MB in the beginning and 90.9MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 86.32ms. Allocated memory is still 157.3MB. Free memory was 90.9MB in the beginning and 85.4MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * RCFGBuilder took 1243.91ms. Allocated memory was 157.3MB in the beginning and 195.0MB in the end (delta: 37.7MB). Free memory was 85.4MB in the beginning and 151.0MB in the end (delta: -65.5MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB.
 * TraceAbstraction took 10812.02ms. Allocated memory was 195.0MB in the beginning and 339.7MB in the end (delta: 144.7MB). Free memory was 151.0MB in the beginning and 252.0MB in the end (delta: -101.0MB). Peak memory consumption was 195.7MB. Max. memory is 16.1GB.
 * Witness Printer took 184.07ms. Allocated memory is still 339.7MB. Free memory was 252.0MB in the beginning and 239.4MB 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: 527]: a call to reach_error is unreachable
    For all program executions holds that a call to reach_error is unreachable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.3s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1588 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1588 mSDsluCounter, 1904 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 206 mSDsCounter, 811 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4735 IncrementalHoareTripleChecker+Invalid, 5546 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 811 mSolverCounterUnsat, 1698 mSDtfsCounter, 4735 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 281 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3832occurred in iteration=6, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 877 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 2379 NumberOfCodeBlocks, 2379 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2365 ConstructedInterpolants, 0 QuantifiedInterpolants, 7614 SizeOfPredicates, 0 NumberOfNonLiveVariables, 387 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 14 InterpolantComputations, 13 PerfectInterpolantSequences, 1146/1156 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
  - InvariantResult [Line: 616]: Loop Invariant
    Derived loop invariant: ((((((((((((((((((a11 <= 0) && (a28 <= 10)) && (a19 == 1)) || (((a11 <= 0) && (a28 <= 10)) && (a25 <= 0))) || ((((8 <= a17) && (a11 == 1)) && (a28 <= 7)) && (a25 <= 0))) || ((((a11 == 1) && (a17 <= 7)) && (a25 == a19)) && (a25 <= 0))) || ((((a11 == 1) && (a17 <= 7)) && (a25 == a19)) && (a28 <= 7))) || ((((a25 == 1) && (a11 == 1)) && (a19 == 1)) && (a28 <= 7))) || ((((((a17 == 8) && (a25 == 1)) && (a11 == 1)) && (a21 == 1)) && (a28 <= 10)) && (a19 == 1))) || (((a17 <= 7) && (a25 == a19)) && (a11 <= 0))) || (((((a17 == 8) && (a25 == 1)) && (a21 == 1)) && (a11 <= 0)) && (a19 == 1))) || ((((((a17 == 8) && (a11 == 1)) && (a21 == 1)) && (a28 <= 10)) && (a19 == 1)) && (a25 <= 0))) || (((9 <= a28) && (a11 == 1)) && (a17 <= 7))) || (((a25 == a19) && (a11 <= 0)) && (a25 <= 0))) || (((a17 <= 7) && (a11 <= 0)) && (a28 <= 10))) || ((a28 == 10) && (a11 <= 0))) || ((a11 <= 0) && (a28 <= 7))) || (((((a17 == 8) && (a25 == 1)) && (a21 == 1)) && (a19 == 1)) && (a28 <= 7)))
RESULT: Ultimate proved your program to be correct!
[2024-11-08 10:27:45,175 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