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


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


Checking for ERROR reachability
Using default analysis
Version 551b0097
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem01_label16.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 2464e957c33404298d60b891632e9df008614058c749595a2f9c32bf73970bbc
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-551b009-m
[2025-01-08 22:52:30,880 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-01-08 22:52:30,930 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-01-08 22:52:30,936 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-01-08 22:52:30,938 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-01-08 22:52:30,958 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-01-08 22:52:30,960 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-01-08 22:52:30,961 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-01-08 22:52:30,961 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-01-08 22:52:30,961 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-01-08 22:52:30,962 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-01-08 22:52:30,962 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-01-08 22:52:30,962 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-01-08 22:52:30,962 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-01-08 22:52:30,962 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-01-08 22:52:30,963 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-01-08 22:52:30,963 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-01-08 22:52:30,963 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-01-08 22:52:30,963 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-01-08 22:52:30,963 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-01-08 22:52:30,963 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-01-08 22:52:30,963 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-01-08 22:52:30,963 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-01-08 22:52:30,963 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-01-08 22:52:30,963 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-01-08 22:52:30,964 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-01-08 22:52:30,964 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-01-08 22:52:30,964 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-01-08 22:52:30,964 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-01-08 22:52:30,964 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-01-08 22:52:30,964 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-01-08 22:52:30,964 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-01-08 22:52:30,964 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-01-08 22:52:30,965 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-01-08 22:52:30,965 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-01-08 22:52:30,965 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-01-08 22:52:30,965 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-01-08 22:52:30,965 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-01-08 22:52:30,965 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-01-08 22:52:30,965 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-01-08 22:52:30,965 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-01-08 22:52:30,965 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-01-08 22:52:30,965 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-01-08 22:52:30,965 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-01-08 22:52:30,965 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-01-08 22:52:30,965 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-01-08 22:52:30,966 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-01-08 22:52:30,966 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-01-08 22:52:30,966 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
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-jdk21/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 -> 2464e957c33404298d60b891632e9df008614058c749595a2f9c32bf73970bbc
[2025-01-08 22:52:31,196 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-01-08 22:52:31,200 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-01-08 22:52:31,202 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-01-08 22:52:31,203 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-01-08 22:52:31,203 INFO  L274        PluginConnector]: CDTParser initialized
[2025-01-08 22:52:31,203 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label16.c
[2025-01-08 22:52:32,305 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/11746faed/15eda2cab7584cc2b088beb485cd4765/FLAGdee0787d2
[2025-01-08 22:52:32,632 INFO  L384              CDTParser]: Found 1 translation units.
[2025-01-08 22:52:32,636 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label16.c
[2025-01-08 22:52:32,652 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/11746faed/15eda2cab7584cc2b088beb485cd4765/FLAGdee0787d2
[2025-01-08 22:52:32,876 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/11746faed/15eda2cab7584cc2b088beb485cd4765
[2025-01-08 22:52:32,878 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-01-08 22:52:32,879 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-01-08 22:52:32,880 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-01-08 22:52:32,881 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-01-08 22:52:32,885 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-01-08 22:52:32,885 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:52:32" (1/1) ...
[2025-01-08 22:52:32,886 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@179209d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:32, skipping insertion in model container
[2025-01-08 22:52:32,886 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:52:32" (1/1) ...
[2025-01-08 22:52:32,918 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-01-08 22:52:33,122 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label16.c[21710,21723]
[2025-01-08 22:52:33,142 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-01-08 22:52:33,149 INFO  L200         MainTranslator]: Completed pre-run
[2025-01-08 22:52:33,203 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label16.c[21710,21723]
[2025-01-08 22:52:33,208 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-01-08 22:52:33,219 INFO  L204         MainTranslator]: Completed translation
[2025-01-08 22:52:33,219 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:33 WrapperNode
[2025-01-08 22:52:33,220 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-01-08 22:52:33,220 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-01-08 22:52:33,220 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-01-08 22:52:33,221 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-01-08 22:52:33,224 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:33" (1/1) ...
[2025-01-08 22:52:33,234 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:33" (1/1) ...
[2025-01-08 22:52:33,270 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 655
[2025-01-08 22:52:33,270 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-01-08 22:52:33,270 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-01-08 22:52:33,271 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-01-08 22:52:33,271 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-01-08 22:52:33,276 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:33" (1/1) ...
[2025-01-08 22:52:33,277 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:33" (1/1) ...
[2025-01-08 22:52:33,279 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:33" (1/1) ...
[2025-01-08 22:52:33,298 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].
[2025-01-08 22:52:33,298 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:33" (1/1) ...
[2025-01-08 22:52:33,298 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:33" (1/1) ...
[2025-01-08 22:52:33,314 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:33" (1/1) ...
[2025-01-08 22:52:33,316 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:33" (1/1) ...
[2025-01-08 22:52:33,327 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:33" (1/1) ...
[2025-01-08 22:52:33,335 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:33" (1/1) ...
[2025-01-08 22:52:33,341 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:33" (1/1) ...
[2025-01-08 22:52:33,346 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-01-08 22:52:33,347 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-01-08 22:52:33,348 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-01-08 22:52:33,348 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-01-08 22:52:33,348 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:33" (1/1) ...
[2025-01-08 22:52:33,353 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-01-08 22:52:33,362 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-08 22:52:33,374 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-01-08 22:52:33,377 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-01-08 22:52:33,393 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-01-08 22:52:33,393 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-01-08 22:52:33,393 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-01-08 22:52:33,393 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-01-08 22:52:33,436 INFO  L234             CfgBuilder]: Building ICFG
[2025-01-08 22:52:33,437 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-01-08 22:52:34,173 INFO  L?                        ?]: Removed 75 outVars from TransFormulas that were not future-live.
[2025-01-08 22:52:34,175 INFO  L283             CfgBuilder]: Performing block encoding
[2025-01-08 22:52:34,185 INFO  L307             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-01-08 22:52:34,187 INFO  L312             CfgBuilder]: Removed 1 assume(true) statements.
[2025-01-08 22:52:34,188 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:52:34 BoogieIcfgContainer
[2025-01-08 22:52:34,188 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-01-08 22:52:34,190 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-01-08 22:52:34,190 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-01-08 22:52:34,193 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-01-08 22:52:34,193 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:52:32" (1/3) ...
[2025-01-08 22:52:34,194 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fa446ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:52:34, skipping insertion in model container
[2025-01-08 22:52:34,194 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:52:33" (2/3) ...
[2025-01-08 22:52:34,194 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fa446ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:52:34, skipping insertion in model container
[2025-01-08 22:52:34,195 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:52:34" (3/3) ...
[2025-01-08 22:52:34,196 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem01_label16.c
[2025-01-08 22:52:34,206 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-01-08 22:52:34,207 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem01_label16.c that has 1 procedures, 198 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-01-08 22:52:34,251 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-01-08 22:52:34,259 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;@2a194d67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-01-08 22:52:34,260 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-01-08 22:52:34,264 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 198 states, 196 states have (on average 1.663265306122449) internal successors, (326), 197 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-08 22:52:34,271 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 131
[2025-01-08 22:52:34,271 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-08 22:52:34,271 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-08 22:52:34,271 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-08 22:52:34,274 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-08 22:52:34,275 INFO  L85        PathProgramCache]: Analyzing trace with hash 2060238935, now seen corresponding path program 1 times
[2025-01-08 22:52:34,279 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-08 22:52:34,280 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547420102]
[2025-01-08 22:52:34,280 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-08 22:52:34,280 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-08 22:52:34,353 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes.
[2025-01-08 22:52:34,422 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements.
[2025-01-08 22:52:34,422 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-08 22:52:34,422 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-08 22:52:34,752 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-08 22:52:34,753 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-08 22:52:34,753 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547420102]
[2025-01-08 22:52:34,754 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547420102] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-08 22:52:34,754 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-08 22:52:34,754 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-01-08 22:52:34,755 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656642805]
[2025-01-08 22:52:34,755 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-08 22:52:34,758 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-01-08 22:52:34,759 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-08 22:52:34,772 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-01-08 22:52:34,772 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-01-08 22:52:34,775 INFO  L87              Difference]: Start difference. First operand  has 198 states, 196 states have (on average 1.663265306122449) internal successors, (326), 197 states have internal predecessors, (326), 0 states have call successors, (0), 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 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-08 22:52:35,320 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-08 22:52:35,321 INFO  L93              Difference]: Finished difference Result 528 states and 912 transitions.
[2025-01-08 22:52:35,321 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-01-08 22:52:35,322 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130
[2025-01-08 22:52:35,323 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-08 22:52:35,330 INFO  L225             Difference]: With dead ends: 528
[2025-01-08 22:52:35,330 INFO  L226             Difference]: Without dead ends: 266
[2025-01-08 22:52:35,332 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-01-08 22:52:35,334 INFO  L435           NwaCegarLoop]: 36 mSDtfsCounter, 65 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-01-08 22:52:35,336 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 44 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-01-08 22:52:35,352 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 266 states.
[2025-01-08 22:52:35,381 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266.
[2025-01-08 22:52:35,382 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 266 states, 265 states have (on average 1.4792452830188678) internal successors, (392), 265 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-08 22:52:35,387 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 392 transitions.
[2025-01-08 22:52:35,388 INFO  L78                 Accepts]: Start accepts. Automaton has 266 states and 392 transitions. Word has length 130
[2025-01-08 22:52:35,389 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-08 22:52:35,389 INFO  L471      AbstractCegarLoop]: Abstraction has 266 states and 392 transitions.
[2025-01-08 22:52:35,389 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-08 22:52:35,389 INFO  L276                IsEmpty]: Start isEmpty. Operand 266 states and 392 transitions.
[2025-01-08 22:52:35,395 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 136
[2025-01-08 22:52:35,395 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-08 22:52:35,396 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-08 22:52:35,396 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-01-08 22:52:35,396 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-08 22:52:35,396 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-08 22:52:35,399 INFO  L85        PathProgramCache]: Analyzing trace with hash -1710409366, now seen corresponding path program 1 times
[2025-01-08 22:52:35,399 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-08 22:52:35,399 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113071795]
[2025-01-08 22:52:35,399 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-08 22:52:35,399 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-08 22:52:35,434 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes.
[2025-01-08 22:52:35,444 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements.
[2025-01-08 22:52:35,444 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-08 22:52:35,444 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-08 22:52:35,579 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-08 22:52:35,580 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-08 22:52:35,580 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113071795]
[2025-01-08 22:52:35,581 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113071795] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-08 22:52:35,581 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-08 22:52:35,581 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-01-08 22:52:35,581 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988211372]
[2025-01-08 22:52:35,581 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-08 22:52:35,582 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-01-08 22:52:35,583 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-08 22:52:35,583 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-01-08 22:52:35,583 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-01-08 22:52:35,584 INFO  L87              Difference]: Start difference. First operand 266 states and 392 transitions. Second operand  has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 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)
[2025-01-08 22:52:35,913 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-08 22:52:35,913 INFO  L93              Difference]: Finished difference Result 792 states and 1171 transitions.
[2025-01-08 22:52:35,913 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-01-08 22:52:35,913 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135
[2025-01-08 22:52:35,913 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-08 22:52:35,915 INFO  L225             Difference]: With dead ends: 792
[2025-01-08 22:52:35,915 INFO  L226             Difference]: Without dead ends: 528
[2025-01-08 22:52:35,916 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-01-08 22:52:35,916 INFO  L435           NwaCegarLoop]: 26 mSDtfsCounter, 149 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-01-08 22:52:35,916 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 31 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-01-08 22:52:35,917 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 528 states.
[2025-01-08 22:52:35,933 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528.
[2025-01-08 22:52:35,933 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 528 states, 527 states have (on average 1.411764705882353) internal successors, (744), 527 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-08 22:52:35,934 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 744 transitions.
[2025-01-08 22:52:35,935 INFO  L78                 Accepts]: Start accepts. Automaton has 528 states and 744 transitions. Word has length 135
[2025-01-08 22:52:35,935 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-08 22:52:35,935 INFO  L471      AbstractCegarLoop]: Abstraction has 528 states and 744 transitions.
[2025-01-08 22:52:35,935 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 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)
[2025-01-08 22:52:35,935 INFO  L276                IsEmpty]: Start isEmpty. Operand 528 states and 744 transitions.
[2025-01-08 22:52:35,936 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 157
[2025-01-08 22:52:35,937 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-08 22:52:35,937 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-08 22:52:35,937 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-01-08 22:52:35,937 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-08 22:52:35,937 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-08 22:52:35,937 INFO  L85        PathProgramCache]: Analyzing trace with hash -747209415, now seen corresponding path program 1 times
[2025-01-08 22:52:35,937 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-08 22:52:35,937 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844429059]
[2025-01-08 22:52:35,937 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-08 22:52:35,938 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-08 22:52:35,972 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes.
[2025-01-08 22:52:35,983 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements.
[2025-01-08 22:52:35,983 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-08 22:52:35,983 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-08 22:52:36,135 INFO  L134       CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-01-08 22:52:36,137 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-08 22:52:36,137 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844429059]
[2025-01-08 22:52:36,137 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844429059] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-08 22:52:36,137 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-08 22:52:36,137 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-01-08 22:52:36,137 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288653451]
[2025-01-08 22:52:36,138 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-08 22:52:36,138 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-01-08 22:52:36,140 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-08 22:52:36,141 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-01-08 22:52:36,141 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-01-08 22:52:36,141 INFO  L87              Difference]: Start difference. First operand 528 states and 744 transitions. Second operand  has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-08 22:52:36,457 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-08 22:52:36,457 INFO  L93              Difference]: Finished difference Result 1447 states and 2048 transitions.
[2025-01-08 22:52:36,458 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-01-08 22:52:36,459 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156
[2025-01-08 22:52:36,459 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-08 22:52:36,461 INFO  L225             Difference]: With dead ends: 1447
[2025-01-08 22:52:36,461 INFO  L226             Difference]: Without dead ends: 921
[2025-01-08 22:52:36,462 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-01-08 22:52:36,464 INFO  L435           NwaCegarLoop]: 51 mSDtfsCounter, 116 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-01-08 22:52:36,465 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 56 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-01-08 22:52:36,466 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 921 states.
[2025-01-08 22:52:36,482 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 790.
[2025-01-08 22:52:36,483 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 790 states, 789 states have (on average 1.320659062103929) internal successors, (1042), 789 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-08 22:52:36,486 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1042 transitions.
[2025-01-08 22:52:36,487 INFO  L78                 Accepts]: Start accepts. Automaton has 790 states and 1042 transitions. Word has length 156
[2025-01-08 22:52:36,487 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-08 22:52:36,488 INFO  L471      AbstractCegarLoop]: Abstraction has 790 states and 1042 transitions.
[2025-01-08 22:52:36,488 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-08 22:52:36,488 INFO  L276                IsEmpty]: Start isEmpty. Operand 790 states and 1042 transitions.
[2025-01-08 22:52:36,490 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 163
[2025-01-08 22:52:36,491 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-08 22:52:36,491 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-08 22:52:36,491 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-01-08 22:52:36,491 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-08 22:52:36,492 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-08 22:52:36,493 INFO  L85        PathProgramCache]: Analyzing trace with hash 2039690184, now seen corresponding path program 1 times
[2025-01-08 22:52:36,493 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-08 22:52:36,493 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824169606]
[2025-01-08 22:52:36,493 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-08 22:52:36,493 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-08 22:52:36,518 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes.
[2025-01-08 22:52:36,523 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements.
[2025-01-08 22:52:36,524 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-08 22:52:36,524 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-08 22:52:36,657 INFO  L134       CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2025-01-08 22:52:36,657 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-08 22:52:36,658 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824169606]
[2025-01-08 22:52:36,658 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824169606] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-08 22:52:36,658 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-08 22:52:36,658 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-01-08 22:52:36,658 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867572737]
[2025-01-08 22:52:36,658 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-08 22:52:36,658 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-01-08 22:52:36,659 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-08 22:52:36,659 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-01-08 22:52:36,659 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-01-08 22:52:36,660 INFO  L87              Difference]: Start difference. First operand 790 states and 1042 transitions. Second operand  has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 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)
[2025-01-08 22:52:37,000 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-08 22:52:37,000 INFO  L93              Difference]: Finished difference Result 1971 states and 2637 transitions.
[2025-01-08 22:52:37,001 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-01-08 22:52:37,001 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 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 162
[2025-01-08 22:52:37,001 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-08 22:52:37,005 INFO  L225             Difference]: With dead ends: 1971
[2025-01-08 22:52:37,005 INFO  L226             Difference]: Without dead ends: 1314
[2025-01-08 22:52:37,006 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-01-08 22:52:37,006 INFO  L435           NwaCegarLoop]: 69 mSDtfsCounter, 126 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-01-08 22:52:37,007 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 73 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-01-08 22:52:37,008 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1314 states.
[2025-01-08 22:52:37,022 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 921.
[2025-01-08 22:52:37,025 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 921 states, 920 states have (on average 1.2880434782608696) internal successors, (1185), 920 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-08 22:52:37,027 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1185 transitions.
[2025-01-08 22:52:37,028 INFO  L78                 Accepts]: Start accepts. Automaton has 921 states and 1185 transitions. Word has length 162
[2025-01-08 22:52:37,028 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-08 22:52:37,028 INFO  L471      AbstractCegarLoop]: Abstraction has 921 states and 1185 transitions.
[2025-01-08 22:52:37,028 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 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)
[2025-01-08 22:52:37,028 INFO  L276                IsEmpty]: Start isEmpty. Operand 921 states and 1185 transitions.
[2025-01-08 22:52:37,030 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 190
[2025-01-08 22:52:37,030 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-08 22:52:37,030 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-08 22:52:37,030 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-01-08 22:52:37,031 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-08 22:52:37,031 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-08 22:52:37,031 INFO  L85        PathProgramCache]: Analyzing trace with hash -454028334, now seen corresponding path program 1 times
[2025-01-08 22:52:37,032 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-08 22:52:37,032 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909408139]
[2025-01-08 22:52:37,032 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-08 22:52:37,032 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-08 22:52:37,058 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes.
[2025-01-08 22:52:37,065 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements.
[2025-01-08 22:52:37,066 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-08 22:52:37,066 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-08 22:52:37,224 INFO  L134       CoverageAnalysis]: Checked inductivity of 108 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked.
[2025-01-08 22:52:37,224 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-08 22:52:37,224 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909408139]
[2025-01-08 22:52:37,224 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909408139] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-08 22:52:37,224 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-08 22:52:37,225 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-01-08 22:52:37,225 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911029981]
[2025-01-08 22:52:37,225 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-08 22:52:37,225 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-01-08 22:52:37,225 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-08 22:52:37,226 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-01-08 22:52:37,226 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-01-08 22:52:37,226 INFO  L87              Difference]: Start difference. First operand 921 states and 1185 transitions. Second operand  has 4 states, 4 states have (on average 36.75) 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)
[2025-01-08 22:52:37,748 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-08 22:52:37,749 INFO  L93              Difference]: Finished difference Result 2364 states and 3048 transitions.
[2025-01-08 22:52:37,749 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-01-08 22:52:37,749 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 36.75) 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 189
[2025-01-08 22:52:37,749 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-08 22:52:37,753 INFO  L225             Difference]: With dead ends: 2364
[2025-01-08 22:52:37,753 INFO  L226             Difference]: Without dead ends: 1445
[2025-01-08 22:52:37,755 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-01-08 22:52:37,755 INFO  L435           NwaCegarLoop]: 44 mSDtfsCounter, 263 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-01-08 22:52:37,756 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 54 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-01-08 22:52:37,758 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1445 states.
[2025-01-08 22:52:37,775 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1314.
[2025-01-08 22:52:37,776 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1314 states, 1313 states have (on average 1.2658035034272659) internal successors, (1662), 1313 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-08 22:52:37,779 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1662 transitions.
[2025-01-08 22:52:37,779 INFO  L78                 Accepts]: Start accepts. Automaton has 1314 states and 1662 transitions. Word has length 189
[2025-01-08 22:52:37,779 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-08 22:52:37,780 INFO  L471      AbstractCegarLoop]: Abstraction has 1314 states and 1662 transitions.
[2025-01-08 22:52:37,780 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 36.75) 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)
[2025-01-08 22:52:37,780 INFO  L276                IsEmpty]: Start isEmpty. Operand 1314 states and 1662 transitions.
[2025-01-08 22:52:37,783 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 219
[2025-01-08 22:52:37,783 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-08 22:52:37,783 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-08 22:52:37,783 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-01-08 22:52:37,783 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-08 22:52:37,784 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-08 22:52:37,784 INFO  L85        PathProgramCache]: Analyzing trace with hash 1222540939, now seen corresponding path program 1 times
[2025-01-08 22:52:37,784 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-08 22:52:37,784 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698554017]
[2025-01-08 22:52:37,784 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-08 22:52:37,784 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-08 22:52:37,809 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes.
[2025-01-08 22:52:37,820 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements.
[2025-01-08 22:52:37,820 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-08 22:52:37,820 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-08 22:52:37,993 INFO  L134       CoverageAnalysis]: Checked inductivity of 195 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked.
[2025-01-08 22:52:37,993 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-08 22:52:37,993 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698554017]
[2025-01-08 22:52:37,993 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698554017] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-08 22:52:37,993 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-08 22:52:37,994 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-01-08 22:52:37,994 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957270706]
[2025-01-08 22:52:37,994 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-08 22:52:37,994 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-01-08 22:52:37,994 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-08 22:52:37,994 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-01-08 22:52:37,995 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-01-08 22:52:37,995 INFO  L87              Difference]: Start difference. First operand 1314 states and 1662 transitions. Second operand  has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-08 22:52:38,515 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-08 22:52:38,515 INFO  L93              Difference]: Finished difference Result 3805 states and 4771 transitions.
[2025-01-08 22:52:38,516 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-01-08 22:52:38,516 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 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 218
[2025-01-08 22:52:38,516 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-08 22:52:38,522 INFO  L225             Difference]: With dead ends: 3805
[2025-01-08 22:52:38,522 INFO  L226             Difference]: Without dead ends: 2362
[2025-01-08 22:52:38,524 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-01-08 22:52:38,525 INFO  L435           NwaCegarLoop]: 30 mSDtfsCounter, 249 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-01-08 22:52:38,525 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 40 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-01-08 22:52:38,527 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2362 states.
[2025-01-08 22:52:38,549 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 1707.
[2025-01-08 22:52:38,551 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1707 states, 1706 states have (on average 1.219812426729191) internal successors, (2081), 1706 states have internal predecessors, (2081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-08 22:52:38,554 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2081 transitions.
[2025-01-08 22:52:38,555 INFO  L78                 Accepts]: Start accepts. Automaton has 1707 states and 2081 transitions. Word has length 218
[2025-01-08 22:52:38,555 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-08 22:52:38,555 INFO  L471      AbstractCegarLoop]: Abstraction has 1707 states and 2081 transitions.
[2025-01-08 22:52:38,555 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-08 22:52:38,556 INFO  L276                IsEmpty]: Start isEmpty. Operand 1707 states and 2081 transitions.
[2025-01-08 22:52:38,559 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 236
[2025-01-08 22:52:38,559 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-08 22:52:38,559 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-01-08 22:52:38,559 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-01-08 22:52:38,559 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-08 22:52:38,560 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-08 22:52:38,560 INFO  L85        PathProgramCache]: Analyzing trace with hash 508065379, now seen corresponding path program 1 times
[2025-01-08 22:52:38,560 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-08 22:52:38,560 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395132326]
[2025-01-08 22:52:38,560 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-08 22:52:38,560 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-08 22:52:38,580 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes.
[2025-01-08 22:52:38,586 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements.
[2025-01-08 22:52:38,586 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-08 22:52:38,586 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-08 22:52:38,853 INFO  L134       CoverageAnalysis]: Checked inductivity of 212 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked.
[2025-01-08 22:52:38,854 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-08 22:52:38,854 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395132326]
[2025-01-08 22:52:38,854 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395132326] provided 0 perfect and 1 imperfect interpolant sequences
[2025-01-08 22:52:38,854 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697767904]
[2025-01-08 22:52:38,854 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-08 22:52:38,854 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-01-08 22:52:38,854 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-08 22:52:38,858 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-01-08 22:52:38,859 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-01-08 22:52:38,908 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes.
[2025-01-08 22:52:38,958 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements.
[2025-01-08 22:52:38,958 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-08 22:52:38,958 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-08 22:52:38,964 INFO  L256         TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-01-08 22:52:38,973 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-01-08 22:52:39,183 INFO  L134       CoverageAnalysis]: Checked inductivity of 212 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked.
[2025-01-08 22:52:39,183 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-01-08 22:52:39,183 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697767904] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-08 22:52:39,184 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-01-08 22:52:39,184 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5
[2025-01-08 22:52:39,184 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555151834]
[2025-01-08 22:52:39,184 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-08 22:52:39,184 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-01-08 22:52:39,184 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-08 22:52:39,184 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-01-08 22:52:39,184 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-01-08 22:52:39,185 INFO  L87              Difference]: Start difference. First operand 1707 states and 2081 transitions. Second operand  has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-08 22:52:39,514 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-08 22:52:39,515 INFO  L93              Difference]: Finished difference Result 3934 states and 4777 transitions.
[2025-01-08 22:52:39,515 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-01-08 22:52:39,515 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 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 235
[2025-01-08 22:52:39,516 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-08 22:52:39,517 INFO  L225             Difference]: With dead ends: 3934
[2025-01-08 22:52:39,517 INFO  L226             Difference]: Without dead ends: 0
[2025-01-08 22:52:39,520 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-01-08 22:52:39,520 INFO  L435           NwaCegarLoop]: 184 mSDtfsCounter, 9 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-01-08 22:52:39,520 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 189 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-01-08 22:52:39,520 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-01-08 22:52:39,521 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-01-08 22:52:39,521 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)
[2025-01-08 22:52:39,521 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-01-08 22:52:39,521 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 235
[2025-01-08 22:52:39,521 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-08 22:52:39,521 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-01-08 22:52:39,521 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-01-08 22:52:39,521 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-01-08 22:52:39,521 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2025-01-08 22:52:39,523 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-01-08 22:52:39,531 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-01-08 22:52:39,728 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-01-08 22:52:39,730 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1]
[2025-01-08 22:52:39,731 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2025-01-08 22:52:39,813 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-01-08 22:52:39,826 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 10:52:39 BoogieIcfgContainer
[2025-01-08 22:52:39,826 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-01-08 22:52:39,827 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-01-08 22:52:39,827 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-01-08 22:52:39,827 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-01-08 22:52:39,828 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:52:34" (3/4) ...
[2025-01-08 22:52:39,830 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-01-08 22:52:39,845 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges
[2025-01-08 22:52:39,846 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2025-01-08 22:52:39,846 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-01-08 22:52:39,847 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-01-08 22:52:39,955 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-01-08 22:52:39,956 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-01-08 22:52:39,956 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-01-08 22:52:39,956 INFO  L158              Benchmark]: Toolchain (without parser) took 7077.30ms. Allocated memory was 167.8MB in the beginning and 260.0MB in the end (delta: 92.3MB). Free memory was 120.3MB in the beginning and 203.4MB in the end (delta: -83.1MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB.
[2025-01-08 22:52:39,956 INFO  L158              Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 120.2MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-01-08 22:52:39,957 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 339.98ms. Allocated memory is still 167.8MB. Free memory was 120.3MB in the beginning and 92.9MB in the end (delta: 27.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2025-01-08 22:52:39,957 INFO  L158              Benchmark]: Boogie Procedure Inliner took 49.79ms. Allocated memory is still 167.8MB. Free memory was 92.9MB in the beginning and 87.7MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-01-08 22:52:39,957 INFO  L158              Benchmark]: Boogie Preprocessor took 75.81ms. Allocated memory is still 167.8MB. Free memory was 87.7MB in the beginning and 82.9MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-01-08 22:52:39,957 INFO  L158              Benchmark]: RCFGBuilder took 840.48ms. Allocated memory is still 167.8MB. Free memory was 82.4MB in the beginning and 84.6MB in the end (delta: -2.1MB). Peak memory consumption was 59.0MB. Max. memory is 16.1GB.
[2025-01-08 22:52:39,957 INFO  L158              Benchmark]: TraceAbstraction took 5637.22ms. Allocated memory was 167.8MB in the beginning and 260.0MB in the end (delta: 92.3MB). Free memory was 84.6MB in the beginning and 214.6MB in the end (delta: -130.1MB). Peak memory consumption was 77.3MB. Max. memory is 16.1GB.
[2025-01-08 22:52:39,957 INFO  L158              Benchmark]: Witness Printer took 128.39ms. Allocated memory is still 260.0MB. Free memory was 214.6MB in the beginning and 203.4MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-01-08 22:52:39,958 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.16ms. Allocated memory is still 201.3MB. Free memory is still 120.2MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 339.98ms. Allocated memory is still 167.8MB. Free memory was 120.3MB in the beginning and 92.9MB in the end (delta: 27.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 49.79ms. Allocated memory is still 167.8MB. Free memory was 92.9MB in the beginning and 87.7MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 75.81ms. Allocated memory is still 167.8MB. Free memory was 87.7MB in the beginning and 82.9MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * RCFGBuilder took 840.48ms. Allocated memory is still 167.8MB. Free memory was 82.4MB in the beginning and 84.6MB in the end (delta: -2.1MB). Peak memory consumption was 59.0MB. Max. memory is 16.1GB.
 * TraceAbstraction took 5637.22ms. Allocated memory was 167.8MB in the beginning and 260.0MB in the end (delta: 92.3MB). Free memory was 84.6MB in the beginning and 214.6MB in the end (delta: -130.1MB). Peak memory consumption was 77.3MB. Max. memory is 16.1GB.
 * Witness Printer took 128.39ms. Allocated memory is still 260.0MB. Free memory was 214.6MB in the beginning and 203.4MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. 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: 576]: a call to reach_error is unreachable
    For all program executions holds that a call to reach_error is unreachable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 7, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 977 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 977 mSDsluCounter, 487 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47 mSDsCounter, 621 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2839 IncrementalHoareTripleChecker+Invalid, 3460 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 621 mSolverCounterUnsat, 440 mSDtfsCounter, 2839 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 253 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1707occurred in iteration=6, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 1310 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1460 NumberOfCodeBlocks, 1460 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1452 ConstructedInterpolants, 0 QuantifiedInterpolants, 2898 SizeOfPredicates, 0 NumberOfNonLiveVariables, 442 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 794/805 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, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
  - InvariantResult [Line: 593]: Loop Invariant
    Derived loop invariant: (((((((a21 == 1) && (a17 == 1)) && (a20 == 1)) || (a8 < 14)) || (((a21 == 1) && (a20 == 1)) && (15 <= a8))) || (a16 < 6)) || ((a7 != 1) && (15 <= a8)))
RESULT: Ultimate proved your program to be correct!
[2025-01-08 22:52:39,971 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

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