./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-81.i --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version c00e63dc
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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-81.i -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 2913f965e0d9fa4df5794a69da1eb9ae7e20a4f8b2461420582f4690c4751bfe
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-05 23:39:42,107 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-05 23:39:42,187 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-02-05 23:39:42,194 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-05 23:39:42,194 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-05 23:39:42,226 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-05 23:39:42,227 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-05 23:39:42,227 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-05 23:39:42,228 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-05 23:39:42,228 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-05 23:39:42,229 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-05 23:39:42,229 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-05 23:39:42,230 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-05 23:39:42,230 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-05 23:39:42,230 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-05 23:39:42,230 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-05 23:39:42,230 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-05 23:39:42,230 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-05 23:39:42,230 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-05 23:39:42,230 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-05 23:39:42,231 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-05 23:39:42,231 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-05 23:39:42,231 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-05 23:39:42,231 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-05 23:39:42,232 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-05 23:39:42,232 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-05 23:39:42,232 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-05 23:39:42,232 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-05 23:39:42,232 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-05 23:39:42,232 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-05 23:39:42,232 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-05 23:39:42,232 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-05 23:39:42,232 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 23:39:42,232 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-05 23:39:42,232 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-05 23:39:42,233 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-05 23:39:42,233 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-05 23:39:42,233 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-05 23:39:42,233 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-05 23:39:42,233 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-05 23:39:42,233 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-05 23:39:42,233 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-05 23:39:42,233 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-05 23:39:42,233 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 -> 2913f965e0d9fa4df5794a69da1eb9ae7e20a4f8b2461420582f4690c4751bfe
[2025-02-05 23:39:42,504 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 23:39:42,516 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 23:39:42,518 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 23:39:42,520 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 23:39:42,520 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 23:39:42,522 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-81.i
[2025-02-05 23:39:43,815 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ff6c3d7f/b32d46ea134f4d2b9665fe3ae0a7a8b5/FLAGe8d78c206
[2025-02-05 23:39:44,189 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 23:39:44,192 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-81.i
[2025-02-05 23:39:44,203 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ff6c3d7f/b32d46ea134f4d2b9665fe3ae0a7a8b5/FLAGe8d78c206
[2025-02-05 23:39:44,226 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ff6c3d7f/b32d46ea134f4d2b9665fe3ae0a7a8b5
[2025-02-05 23:39:44,230 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 23:39:44,232 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 23:39:44,234 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 23:39:44,235 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 23:39:44,239 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 23:39:44,240 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:39:44" (1/1) ...
[2025-02-05 23:39:44,241 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8865dcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:44, skipping insertion in model container
[2025-02-05 23:39:44,241 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:39:44" (1/1) ...
[2025-02-05 23:39:44,264 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 23:39:44,403 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-81.i[919,932]
[2025-02-05 23:39:44,510 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 23:39:44,532 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 23:39:44,546 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-81.i[919,932]
[2025-02-05 23:39:44,593 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 23:39:44,614 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 23:39:44,615 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:44 WrapperNode
[2025-02-05 23:39:44,615 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 23:39:44,617 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 23:39:44,617 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 23:39:44,617 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 23:39:44,622 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:44" (1/1) ...
[2025-02-05 23:39:44,633 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:44" (1/1) ...
[2025-02-05 23:39:44,689 INFO  L138                Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 247
[2025-02-05 23:39:44,689 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 23:39:44,690 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 23:39:44,690 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 23:39:44,690 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 23:39:44,699 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:44" (1/1) ...
[2025-02-05 23:39:44,699 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:44" (1/1) ...
[2025-02-05 23:39:44,707 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:44" (1/1) ...
[2025-02-05 23:39:44,742 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-02-05 23:39:44,743 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:44" (1/1) ...
[2025-02-05 23:39:44,743 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:44" (1/1) ...
[2025-02-05 23:39:44,756 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:44" (1/1) ...
[2025-02-05 23:39:44,757 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:44" (1/1) ...
[2025-02-05 23:39:44,759 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:44" (1/1) ...
[2025-02-05 23:39:44,760 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:44" (1/1) ...
[2025-02-05 23:39:44,764 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 23:39:44,765 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 23:39:44,765 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 23:39:44,765 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 23:39:44,766 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:44" (1/1) ...
[2025-02-05 23:39:44,772 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 23:39:44,783 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 23:39:44,798 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-02-05 23:39:44,804 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-02-05 23:39:44,822 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 23:39:44,823 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-02-05 23:39:44,823 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-02-05 23:39:44,823 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 23:39:44,823 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 23:39:44,823 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 23:39:44,912 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 23:39:44,914 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 23:39:45,351 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L187: havoc property_#t~bitwise25#1;havoc property_#t~short26#1;
[2025-02-05 23:39:45,386 INFO  L?                        ?]: Removed 16 outVars from TransFormulas that were not future-live.
[2025-02-05 23:39:45,387 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 23:39:45,408 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 23:39:45,409 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 23:39:45,409 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:39:45 BoogieIcfgContainer
[2025-02-05 23:39:45,409 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 23:39:45,412 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 23:39:45,412 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 23:39:45,416 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 23:39:45,417 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:39:44" (1/3) ...
[2025-02-05 23:39:45,417 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36bbfcd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:39:45, skipping insertion in model container
[2025-02-05 23:39:45,418 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:44" (2/3) ...
[2025-02-05 23:39:45,419 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36bbfcd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:39:45, skipping insertion in model container
[2025-02-05 23:39:45,419 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:39:45" (3/3) ...
[2025-02-05 23:39:45,420 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-81.i
[2025-02-05 23:39:45,436 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 23:39:45,438 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-81.i that has 2 procedures, 105 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 23:39:45,488 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 23:39:45,499 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;@61feac02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 23:39:45,499 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 23:39:45,505 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 105 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 72 states have internal predecessors, (104), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31)
[2025-02-05 23:39:45,521 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 203
[2025-02-05 23:39:45,521 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 23:39:45,522 INFO  L218           NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:39:45,522 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 23:39:45,526 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 23:39:45,527 INFO  L85        PathProgramCache]: Analyzing trace with hash -1551107637, now seen corresponding path program 1 times
[2025-02-05 23:39:45,532 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 23:39:45,532 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545970848]
[2025-02-05 23:39:45,533 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 23:39:45,533 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 23:39:45,611 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes.
[2025-02-05 23:39:45,638 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements.
[2025-02-05 23:39:45,639 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 23:39:45,639 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 23:39:45,935 INFO  L134       CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked.
[2025-02-05 23:39:45,935 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 23:39:45,935 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545970848]
[2025-02-05 23:39:45,936 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545970848] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 23:39:45,937 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968602302]
[2025-02-05 23:39:45,937 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 23:39:45,937 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 23:39:45,937 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 23:39:45,941 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-02-05 23:39:45,942 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-02-05 23:39:46,056 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes.
[2025-02-05 23:39:46,159 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements.
[2025-02-05 23:39:46,160 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 23:39:46,160 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 23:39:46,165 INFO  L256         TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-02-05 23:39:46,177 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 23:39:46,209 INFO  L134       CoverageAnalysis]: Checked inductivity of 1860 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked.
[2025-02-05 23:39:46,209 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 23:39:46,209 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968602302] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 23:39:46,209 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 23:39:46,210 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-02-05 23:39:46,211 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308096575]
[2025-02-05 23:39:46,212 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 23:39:46,215 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-02-05 23:39:46,215 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 23:39:46,232 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-02-05 23:39:46,233 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-05 23:39:46,235 INFO  L87              Difference]: Start difference. First operand  has 105 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 72 states have internal predecessors, (104), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand  has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31)
[2025-02-05 23:39:46,273 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 23:39:46,274 INFO  L93              Difference]: Finished difference Result 204 states and 358 transitions.
[2025-02-05 23:39:46,275 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-02-05 23:39:46,276 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 202
[2025-02-05 23:39:46,277 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 23:39:46,282 INFO  L225             Difference]: With dead ends: 204
[2025-02-05 23:39:46,282 INFO  L226             Difference]: Without dead ends: 102
[2025-02-05 23:39:46,285 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-05 23:39:46,289 INFO  L435           NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 23:39:46,289 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 23:39:46,302 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 102 states.
[2025-02-05 23:39:46,323 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102.
[2025-02-05 23:39:46,324 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 102 states, 69 states have (on average 1.434782608695652) internal successors, (99), 69 states have internal predecessors, (99), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31)
[2025-02-05 23:39:46,329 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 161 transitions.
[2025-02-05 23:39:46,331 INFO  L78                 Accepts]: Start accepts. Automaton has 102 states and 161 transitions. Word has length 202
[2025-02-05 23:39:46,331 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 23:39:46,331 INFO  L471      AbstractCegarLoop]: Abstraction has 102 states and 161 transitions.
[2025-02-05 23:39:46,332 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31)
[2025-02-05 23:39:46,332 INFO  L276                IsEmpty]: Start isEmpty. Operand 102 states and 161 transitions.
[2025-02-05 23:39:46,335 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 203
[2025-02-05 23:39:46,335 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 23:39:46,335 INFO  L218           NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:39:46,342 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-02-05 23:39:46,536 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0
[2025-02-05 23:39:46,536 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 23:39:46,537 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 23:39:46,537 INFO  L85        PathProgramCache]: Analyzing trace with hash 1892852102, now seen corresponding path program 1 times
[2025-02-05 23:39:46,537 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 23:39:46,537 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830309830]
[2025-02-05 23:39:46,537 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 23:39:46,537 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 23:39:46,558 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes.
[2025-02-05 23:39:46,633 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements.
[2025-02-05 23:39:46,634 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 23:39:46,634 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 23:39:46,967 INFO  L134       CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked.
[2025-02-05 23:39:46,968 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 23:39:46,968 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830309830]
[2025-02-05 23:39:46,968 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830309830] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 23:39:46,968 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 23:39:46,968 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 23:39:46,968 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966279030]
[2025-02-05 23:39:46,968 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 23:39:46,969 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 23:39:46,969 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 23:39:46,972 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 23:39:46,972 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 23:39:46,972 INFO  L87              Difference]: Start difference. First operand 102 states and 161 transitions. Second operand  has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-02-05 23:39:47,063 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 23:39:47,064 INFO  L93              Difference]: Finished difference Result 283 states and 453 transitions.
[2025-02-05 23:39:47,065 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 23:39:47,066 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202
[2025-02-05 23:39:47,067 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 23:39:47,068 INFO  L225             Difference]: With dead ends: 283
[2025-02-05 23:39:47,069 INFO  L226             Difference]: Without dead ends: 184
[2025-02-05 23:39:47,072 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 23:39:47,073 INFO  L435           NwaCegarLoop]: 151 mSDtfsCounter, 76 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 23:39:47,073 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 291 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 23:39:47,074 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 184 states.
[2025-02-05 23:39:47,106 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 169.
[2025-02-05 23:39:47,109 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 169 states, 104 states have (on average 1.3653846153846154) internal successors, (142), 104 states have internal predecessors, (142), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62)
[2025-02-05 23:39:47,111 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 266 transitions.
[2025-02-05 23:39:47,113 INFO  L78                 Accepts]: Start accepts. Automaton has 169 states and 266 transitions. Word has length 202
[2025-02-05 23:39:47,114 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 23:39:47,114 INFO  L471      AbstractCegarLoop]: Abstraction has 169 states and 266 transitions.
[2025-02-05 23:39:47,114 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-02-05 23:39:47,115 INFO  L276                IsEmpty]: Start isEmpty. Operand 169 states and 266 transitions.
[2025-02-05 23:39:47,117 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 205
[2025-02-05 23:39:47,120 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 23:39:47,120 INFO  L218           NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:39:47,120 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 23:39:47,120 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 23:39:47,121 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 23:39:47,121 INFO  L85        PathProgramCache]: Analyzing trace with hash 762052910, now seen corresponding path program 1 times
[2025-02-05 23:39:47,121 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 23:39:47,121 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082187039]
[2025-02-05 23:39:47,121 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 23:39:47,121 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 23:39:47,140 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes.
[2025-02-05 23:39:47,184 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements.
[2025-02-05 23:39:47,184 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 23:39:47,185 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 23:39:47,390 INFO  L134       CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked.
[2025-02-05 23:39:47,391 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 23:39:47,391 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082187039]
[2025-02-05 23:39:47,391 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082187039] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 23:39:47,391 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 23:39:47,391 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 23:39:47,391 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796943414]
[2025-02-05 23:39:47,391 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 23:39:47,392 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 23:39:47,392 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 23:39:47,392 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 23:39:47,392 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 23:39:47,395 INFO  L87              Difference]: Start difference. First operand 169 states and 266 transitions. Second operand  has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-02-05 23:39:47,577 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 23:39:47,579 INFO  L93              Difference]: Finished difference Result 399 states and 625 transitions.
[2025-02-05 23:39:47,579 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 23:39:47,580 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 204
[2025-02-05 23:39:47,580 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 23:39:47,583 INFO  L225             Difference]: With dead ends: 399
[2025-02-05 23:39:47,583 INFO  L226             Difference]: Without dead ends: 300
[2025-02-05 23:39:47,587 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-02-05 23:39:47,588 INFO  L435           NwaCegarLoop]: 175 mSDtfsCounter, 178 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 23:39:47,588 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 362 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 23:39:47,589 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 300 states.
[2025-02-05 23:39:47,639 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 273.
[2025-02-05 23:39:47,642 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 273 states, 202 states have (on average 1.4851485148514851) internal successors, (300), 203 states have internal predecessors, (300), 66 states have call successors, (66), 4 states have call predecessors, (66), 4 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66)
[2025-02-05 23:39:47,644 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 432 transitions.
[2025-02-05 23:39:47,645 INFO  L78                 Accepts]: Start accepts. Automaton has 273 states and 432 transitions. Word has length 204
[2025-02-05 23:39:47,646 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 23:39:47,646 INFO  L471      AbstractCegarLoop]: Abstraction has 273 states and 432 transitions.
[2025-02-05 23:39:47,647 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-02-05 23:39:47,647 INFO  L276                IsEmpty]: Start isEmpty. Operand 273 states and 432 transitions.
[2025-02-05 23:39:47,649 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 205
[2025-02-05 23:39:47,649 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 23:39:47,649 INFO  L218           NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:39:47,650 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-05 23:39:47,650 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 23:39:47,650 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 23:39:47,651 INFO  L85        PathProgramCache]: Analyzing trace with hash 565539405, now seen corresponding path program 1 times
[2025-02-05 23:39:47,651 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 23:39:47,651 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406002545]
[2025-02-05 23:39:47,651 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 23:39:47,651 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 23:39:47,670 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes.
[2025-02-05 23:39:47,705 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements.
[2025-02-05 23:39:47,706 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 23:39:47,706 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 23:39:47,913 INFO  L134       CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked.
[2025-02-05 23:39:47,914 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 23:39:47,914 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406002545]
[2025-02-05 23:39:47,914 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406002545] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 23:39:47,914 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 23:39:47,914 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 23:39:47,915 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623168906]
[2025-02-05 23:39:47,915 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 23:39:47,916 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 23:39:47,916 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 23:39:47,916 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 23:39:47,917 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 23:39:47,918 INFO  L87              Difference]: Start difference. First operand 273 states and 432 transitions. Second operand  has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-02-05 23:39:48,001 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 23:39:48,002 INFO  L93              Difference]: Finished difference Result 505 states and 807 transitions.
[2025-02-05 23:39:48,003 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 23:39:48,003 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 204
[2025-02-05 23:39:48,004 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 23:39:48,009 INFO  L225             Difference]: With dead ends: 505
[2025-02-05 23:39:48,011 INFO  L226             Difference]: Without dead ends: 317
[2025-02-05 23:39:48,012 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 23:39:48,013 INFO  L435           NwaCegarLoop]: 150 mSDtfsCounter, 74 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 23:39:48,014 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 436 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 23:39:48,014 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 317 states.
[2025-02-05 23:39:48,045 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 273.
[2025-02-05 23:39:48,046 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 273 states, 202 states have (on average 1.4702970297029703) internal successors, (297), 203 states have internal predecessors, (297), 66 states have call successors, (66), 4 states have call predecessors, (66), 4 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66)
[2025-02-05 23:39:48,048 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 429 transitions.
[2025-02-05 23:39:48,052 INFO  L78                 Accepts]: Start accepts. Automaton has 273 states and 429 transitions. Word has length 204
[2025-02-05 23:39:48,052 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 23:39:48,052 INFO  L471      AbstractCegarLoop]: Abstraction has 273 states and 429 transitions.
[2025-02-05 23:39:48,053 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-02-05 23:39:48,053 INFO  L276                IsEmpty]: Start isEmpty. Operand 273 states and 429 transitions.
[2025-02-05 23:39:48,054 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 206
[2025-02-05 23:39:48,054 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 23:39:48,055 INFO  L218           NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:39:48,055 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-05 23:39:48,055 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 23:39:48,055 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 23:39:48,055 INFO  L85        PathProgramCache]: Analyzing trace with hash -1850823708, now seen corresponding path program 1 times
[2025-02-05 23:39:48,057 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 23:39:48,057 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093701422]
[2025-02-05 23:39:48,058 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 23:39:48,058 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 23:39:48,074 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes.
[2025-02-05 23:39:48,205 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements.
[2025-02-05 23:39:48,208 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 23:39:48,208 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 23:39:48,558 INFO  L134       CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked.
[2025-02-05 23:39:48,558 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 23:39:48,558 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093701422]
[2025-02-05 23:39:48,558 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093701422] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 23:39:48,558 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 23:39:48,558 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 23:39:48,559 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014658287]
[2025-02-05 23:39:48,559 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 23:39:48,559 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 23:39:48,559 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 23:39:48,560 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 23:39:48,560 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 23:39:48,560 INFO  L87              Difference]: Start difference. First operand 273 states and 429 transitions. Second operand  has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-02-05 23:39:48,730 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 23:39:48,730 INFO  L93              Difference]: Finished difference Result 504 states and 789 transitions.
[2025-02-05 23:39:48,731 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 23:39:48,731 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205
[2025-02-05 23:39:48,732 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 23:39:48,734 INFO  L225             Difference]: With dead ends: 504
[2025-02-05 23:39:48,734 INFO  L226             Difference]: Without dead ends: 307
[2025-02-05 23:39:48,735 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 23:39:48,736 INFO  L435           NwaCegarLoop]: 188 mSDtfsCounter, 74 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 23:39:48,736 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 489 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 23:39:48,737 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 307 states.
[2025-02-05 23:39:48,771 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 255.
[2025-02-05 23:39:48,772 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 255 states, 188 states have (on average 1.425531914893617) internal successors, (268), 188 states have internal predecessors, (268), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62)
[2025-02-05 23:39:48,775 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 392 transitions.
[2025-02-05 23:39:48,775 INFO  L78                 Accepts]: Start accepts. Automaton has 255 states and 392 transitions. Word has length 205
[2025-02-05 23:39:48,776 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 23:39:48,776 INFO  L471      AbstractCegarLoop]: Abstraction has 255 states and 392 transitions.
[2025-02-05 23:39:48,776 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-02-05 23:39:48,776 INFO  L276                IsEmpty]: Start isEmpty. Operand 255 states and 392 transitions.
[2025-02-05 23:39:48,779 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 206
[2025-02-05 23:39:48,779 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 23:39:48,779 INFO  L218           NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:39:48,779 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-05 23:39:48,779 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 23:39:48,780 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 23:39:48,780 INFO  L85        PathProgramCache]: Analyzing trace with hash 843705734, now seen corresponding path program 1 times
[2025-02-05 23:39:48,780 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 23:39:48,780 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271048521]
[2025-02-05 23:39:48,781 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 23:39:48,781 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 23:39:48,805 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes.
[2025-02-05 23:39:48,922 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements.
[2025-02-05 23:39:48,922 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 23:39:48,922 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 23:40:04,257 INFO  L134       CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked.
[2025-02-05 23:40:04,258 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 23:40:04,258 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271048521]
[2025-02-05 23:40:04,258 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271048521] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 23:40:04,258 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 23:40:04,258 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2025-02-05 23:40:04,258 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692878931]
[2025-02-05 23:40:04,258 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 23:40:04,259 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2025-02-05 23:40:04,259 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 23:40:04,260 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2025-02-05 23:40:04,260 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210
[2025-02-05 23:40:04,261 INFO  L87              Difference]: Start difference. First operand 255 states and 392 transitions. Second operand  has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31)
[2025-02-05 23:40:08,347 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 23:40:08,348 INFO  L93              Difference]: Finished difference Result 721 states and 1088 transitions.
[2025-02-05 23:40:08,348 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2025-02-05 23:40:08,348 INFO  L78                 Accepts]: Start accepts. Automaton has  has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 205
[2025-02-05 23:40:08,349 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 23:40:08,352 INFO  L225             Difference]: With dead ends: 721
[2025-02-05 23:40:08,354 INFO  L226             Difference]: Without dead ends: 559
[2025-02-05 23:40:08,355 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=217, Invalid=539, Unknown=0, NotChecked=0, Total=756
[2025-02-05 23:40:08,356 INFO  L435           NwaCegarLoop]: 136 mSDtfsCounter, 559 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time
[2025-02-05 23:40:08,356 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 1095 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time]
[2025-02-05 23:40:08,357 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 559 states.
[2025-02-05 23:40:08,387 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 387.
[2025-02-05 23:40:08,389 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 387 states, 307 states have (on average 1.4397394136807817) internal successors, (442), 308 states have internal predecessors, (442), 72 states have call successors, (72), 7 states have call predecessors, (72), 7 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72)
[2025-02-05 23:40:08,391 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 586 transitions.
[2025-02-05 23:40:08,391 INFO  L78                 Accepts]: Start accepts. Automaton has 387 states and 586 transitions. Word has length 205
[2025-02-05 23:40:08,393 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 23:40:08,395 INFO  L471      AbstractCegarLoop]: Abstraction has 387 states and 586 transitions.
[2025-02-05 23:40:08,396 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31)
[2025-02-05 23:40:08,396 INFO  L276                IsEmpty]: Start isEmpty. Operand 387 states and 586 transitions.
[2025-02-05 23:40:08,398 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 206
[2025-02-05 23:40:08,398 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 23:40:08,398 INFO  L218           NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:40:08,400 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-05 23:40:08,400 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 23:40:08,400 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 23:40:08,401 INFO  L85        PathProgramCache]: Analyzing trace with hash 972788453, now seen corresponding path program 1 times
[2025-02-05 23:40:08,401 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 23:40:08,401 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757646563]
[2025-02-05 23:40:08,401 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 23:40:08,401 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 23:40:08,418 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes.
[2025-02-05 23:40:08,485 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements.
[2025-02-05 23:40:08,485 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 23:40:08,485 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 23:40:09,933 INFO  L134       CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked.
[2025-02-05 23:40:09,934 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 23:40:09,934 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757646563]
[2025-02-05 23:40:09,934 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757646563] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 23:40:09,934 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 23:40:09,934 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2025-02-05 23:40:09,934 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442302900]
[2025-02-05 23:40:09,934 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 23:40:09,935 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-02-05 23:40:09,935 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 23:40:09,935 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-02-05 23:40:09,936 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132
[2025-02-05 23:40:09,936 INFO  L87              Difference]: Start difference. First operand 387 states and 586 transitions. Second operand  has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31)
[2025-02-05 23:40:11,749 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 23:40:11,749 INFO  L93              Difference]: Finished difference Result 814 states and 1222 transitions.
[2025-02-05 23:40:11,749 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2025-02-05 23:40:11,749 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 205
[2025-02-05 23:40:11,750 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 23:40:11,753 INFO  L225             Difference]: With dead ends: 814
[2025-02-05 23:40:11,753 INFO  L226             Difference]: Without dead ends: 614
[2025-02-05 23:40:11,754 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=201, Invalid=555, Unknown=0, NotChecked=0, Total=756
[2025-02-05 23:40:11,754 INFO  L435           NwaCegarLoop]: 142 mSDtfsCounter, 733 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-02-05 23:40:11,755 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 934 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-02-05 23:40:11,755 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 614 states.
[2025-02-05 23:40:11,784 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 451.
[2025-02-05 23:40:11,785 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 451 states, 370 states have (on average 1.4513513513513514) internal successors, (537), 371 states have internal predecessors, (537), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72)
[2025-02-05 23:40:11,787 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 681 transitions.
[2025-02-05 23:40:11,788 INFO  L78                 Accepts]: Start accepts. Automaton has 451 states and 681 transitions. Word has length 205
[2025-02-05 23:40:11,788 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 23:40:11,788 INFO  L471      AbstractCegarLoop]: Abstraction has 451 states and 681 transitions.
[2025-02-05 23:40:11,789 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31)
[2025-02-05 23:40:11,789 INFO  L276                IsEmpty]: Start isEmpty. Operand 451 states and 681 transitions.
[2025-02-05 23:40:11,794 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 206
[2025-02-05 23:40:11,794 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 23:40:11,794 INFO  L218           NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:40:11,794 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-05 23:40:11,795 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 23:40:11,795 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 23:40:11,795 INFO  L85        PathProgramCache]: Analyzing trace with hash 467229828, now seen corresponding path program 1 times
[2025-02-05 23:40:11,795 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 23:40:11,795 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936567071]
[2025-02-05 23:40:11,795 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 23:40:11,795 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 23:40:11,812 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes.
[2025-02-05 23:40:11,849 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements.
[2025-02-05 23:40:11,849 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 23:40:11,850 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 23:40:12,771 INFO  L134       CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked.
[2025-02-05 23:40:12,771 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 23:40:12,772 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936567071]
[2025-02-05 23:40:12,772 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936567071] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 23:40:12,772 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 23:40:12,772 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2025-02-05 23:40:12,772 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227934897]
[2025-02-05 23:40:12,772 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 23:40:12,773 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-02-05 23:40:12,774 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 23:40:12,774 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-02-05 23:40:12,775 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2025-02-05 23:40:12,775 INFO  L87              Difference]: Start difference. First operand 451 states and 681 transitions. Second operand  has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31)
[2025-02-05 23:40:13,821 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 23:40:13,821 INFO  L93              Difference]: Finished difference Result 738 states and 1116 transitions.
[2025-02-05 23:40:13,822 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-02-05 23:40:13,822 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 205
[2025-02-05 23:40:13,823 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 23:40:13,825 INFO  L225             Difference]: With dead ends: 738
[2025-02-05 23:40:13,826 INFO  L226             Difference]: Without dead ends: 538
[2025-02-05 23:40:13,827 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420
[2025-02-05 23:40:13,827 INFO  L435           NwaCegarLoop]: 144 mSDtfsCounter, 487 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 23:40:13,827 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 774 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 23:40:13,828 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 538 states.
[2025-02-05 23:40:13,859 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 437.
[2025-02-05 23:40:13,860 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 437 states, 356 states have (on average 1.446629213483146) internal successors, (515), 357 states have internal predecessors, (515), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72)
[2025-02-05 23:40:13,862 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 659 transitions.
[2025-02-05 23:40:13,863 INFO  L78                 Accepts]: Start accepts. Automaton has 437 states and 659 transitions. Word has length 205
[2025-02-05 23:40:13,863 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 23:40:13,863 INFO  L471      AbstractCegarLoop]: Abstraction has 437 states and 659 transitions.
[2025-02-05 23:40:13,864 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31)
[2025-02-05 23:40:13,864 INFO  L276                IsEmpty]: Start isEmpty. Operand 437 states and 659 transitions.
[2025-02-05 23:40:13,866 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 207
[2025-02-05 23:40:13,866 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 23:40:13,867 INFO  L218           NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:40:13,867 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-05 23:40:13,867 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 23:40:13,867 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 23:40:13,868 INFO  L85        PathProgramCache]: Analyzing trace with hash 975372336, now seen corresponding path program 1 times
[2025-02-05 23:40:13,868 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 23:40:13,868 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869860967]
[2025-02-05 23:40:13,868 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 23:40:13,868 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 23:40:13,879 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes.
[2025-02-05 23:40:13,942 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements.
[2025-02-05 23:40:13,943 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 23:40:13,943 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 23:40:20,156 INFO  L134       CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked.
[2025-02-05 23:40:20,156 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 23:40:20,156 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869860967]
[2025-02-05 23:40:20,156 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869860967] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 23:40:20,157 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 23:40:20,157 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-02-05 23:40:20,157 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379665046]
[2025-02-05 23:40:20,157 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 23:40:20,157 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-02-05 23:40:20,157 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 23:40:20,157 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-02-05 23:40:20,158 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2025-02-05 23:40:20,158 INFO  L87              Difference]: Start difference. First operand 437 states and 659 transitions. Second operand  has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-02-05 23:40:21,601 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 23:40:21,601 INFO  L93              Difference]: Finished difference Result 741 states and 1111 transitions.
[2025-02-05 23:40:21,601 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-02-05 23:40:21,601 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206
[2025-02-05 23:40:21,602 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 23:40:21,604 INFO  L225             Difference]: With dead ends: 741
[2025-02-05 23:40:21,604 INFO  L226             Difference]: Without dead ends: 551
[2025-02-05 23:40:21,605 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182
[2025-02-05 23:40:21,606 INFO  L435           NwaCegarLoop]: 139 mSDtfsCounter, 198 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 23:40:21,606 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 522 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 23:40:21,607 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 551 states.
[2025-02-05 23:40:21,634 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 473.
[2025-02-05 23:40:21,636 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 473 states, 392 states have (on average 1.4489795918367347) internal successors, (568), 393 states have internal predecessors, (568), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72)
[2025-02-05 23:40:21,638 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 712 transitions.
[2025-02-05 23:40:21,638 INFO  L78                 Accepts]: Start accepts. Automaton has 473 states and 712 transitions. Word has length 206
[2025-02-05 23:40:21,639 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 23:40:21,639 INFO  L471      AbstractCegarLoop]: Abstraction has 473 states and 712 transitions.
[2025-02-05 23:40:21,639 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-02-05 23:40:21,639 INFO  L276                IsEmpty]: Start isEmpty. Operand 473 states and 712 transitions.
[2025-02-05 23:40:21,641 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 207
[2025-02-05 23:40:21,641 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 23:40:21,642 INFO  L218           NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:40:21,642 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-05 23:40:21,643 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 23:40:21,643 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 23:40:21,643 INFO  L85        PathProgramCache]: Analyzing trace with hash 1104455055, now seen corresponding path program 1 times
[2025-02-05 23:40:21,643 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 23:40:21,643 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336677075]
[2025-02-05 23:40:21,643 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 23:40:21,644 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 23:40:21,656 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes.
[2025-02-05 23:40:21,694 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements.
[2025-02-05 23:40:21,695 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 23:40:21,695 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 23:40:22,586 INFO  L134       CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked.
[2025-02-05 23:40:22,586 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 23:40:22,586 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336677075]
[2025-02-05 23:40:22,587 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336677075] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 23:40:22,587 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 23:40:22,587 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-02-05 23:40:22,587 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535742368]
[2025-02-05 23:40:22,587 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 23:40:22,588 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-02-05 23:40:22,588 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 23:40:22,588 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-02-05 23:40:22,589 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2025-02-05 23:40:22,589 INFO  L87              Difference]: Start difference. First operand 473 states and 712 transitions. Second operand  has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31)
[2025-02-05 23:40:23,519 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 23:40:23,519 INFO  L93              Difference]: Finished difference Result 1093 states and 1643 transitions.
[2025-02-05 23:40:23,520 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-02-05 23:40:23,520 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 206
[2025-02-05 23:40:23,520 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 23:40:23,525 INFO  L225             Difference]: With dead ends: 1093
[2025-02-05 23:40:23,525 INFO  L226             Difference]: Without dead ends: 839
[2025-02-05 23:40:23,526 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240
[2025-02-05 23:40:23,526 INFO  L435           NwaCegarLoop]: 142 mSDtfsCounter, 510 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 23:40:23,527 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 688 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 23:40:23,528 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 839 states.
[2025-02-05 23:40:23,555 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 549.
[2025-02-05 23:40:23,557 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 549 states, 468 states have (on average 1.4423076923076923) internal successors, (675), 469 states have internal predecessors, (675), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72)
[2025-02-05 23:40:23,559 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 819 transitions.
[2025-02-05 23:40:23,560 INFO  L78                 Accepts]: Start accepts. Automaton has 549 states and 819 transitions. Word has length 206
[2025-02-05 23:40:23,560 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 23:40:23,560 INFO  L471      AbstractCegarLoop]: Abstraction has 549 states and 819 transitions.
[2025-02-05 23:40:23,560 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31)
[2025-02-05 23:40:23,560 INFO  L276                IsEmpty]: Start isEmpty. Operand 549 states and 819 transitions.
[2025-02-05 23:40:23,562 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 207
[2025-02-05 23:40:23,562 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 23:40:23,562 INFO  L218           NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:40:23,562 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-05 23:40:23,562 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 23:40:23,563 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 23:40:23,563 INFO  L85        PathProgramCache]: Analyzing trace with hash 598896430, now seen corresponding path program 1 times
[2025-02-05 23:40:23,563 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 23:40:23,563 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79588368]
[2025-02-05 23:40:23,563 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 23:40:23,563 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 23:40:23,574 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes.
[2025-02-05 23:40:23,608 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements.
[2025-02-05 23:40:23,608 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 23:40:23,608 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 23:40:24,073 INFO  L134       CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked.
[2025-02-05 23:40:24,073 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 23:40:24,073 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79588368]
[2025-02-05 23:40:24,073 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79588368] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 23:40:24,073 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 23:40:24,074 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-02-05 23:40:24,074 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240481616]
[2025-02-05 23:40:24,074 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 23:40:24,074 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-05 23:40:24,074 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 23:40:24,074 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-05 23:40:24,074 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-02-05 23:40:24,075 INFO  L87              Difference]: Start difference. First operand 549 states and 819 transitions. Second operand  has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-02-05 23:40:24,572 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 23:40:24,573 INFO  L93              Difference]: Finished difference Result 851 states and 1277 transitions.
[2025-02-05 23:40:24,573 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-05 23:40:24,573 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206
[2025-02-05 23:40:24,574 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 23:40:24,577 INFO  L225             Difference]: With dead ends: 851
[2025-02-05 23:40:24,577 INFO  L226             Difference]: Without dead ends: 597
[2025-02-05 23:40:24,578 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110
[2025-02-05 23:40:24,579 INFO  L435           NwaCegarLoop]: 146 mSDtfsCounter, 153 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 23:40:24,579 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 666 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 23:40:24,580 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 597 states.
[2025-02-05 23:40:24,618 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 509.
[2025-02-05 23:40:24,619 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 509 states, 428 states have (on average 1.4322429906542056) internal successors, (613), 429 states have internal predecessors, (613), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72)
[2025-02-05 23:40:24,621 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 757 transitions.
[2025-02-05 23:40:24,622 INFO  L78                 Accepts]: Start accepts. Automaton has 509 states and 757 transitions. Word has length 206
[2025-02-05 23:40:24,622 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 23:40:24,622 INFO  L471      AbstractCegarLoop]: Abstraction has 509 states and 757 transitions.
[2025-02-05 23:40:24,623 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-02-05 23:40:24,623 INFO  L276                IsEmpty]: Start isEmpty. Operand 509 states and 757 transitions.
[2025-02-05 23:40:24,626 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 207
[2025-02-05 23:40:24,626 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 23:40:24,627 INFO  L218           NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:40:24,627 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-05 23:40:24,628 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 23:40:24,628 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 23:40:24,629 INFO  L85        PathProgramCache]: Analyzing trace with hash -228067063, now seen corresponding path program 1 times
[2025-02-05 23:40:24,629 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 23:40:24,629 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684303924]
[2025-02-05 23:40:24,629 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 23:40:24,629 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 23:40:24,641 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes.
[2025-02-05 23:40:24,689 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements.
[2025-02-05 23:40:24,690 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 23:40:24,690 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 23:40:31,295 INFO  L134       CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked.
[2025-02-05 23:40:31,296 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 23:40:31,296 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684303924]
[2025-02-05 23:40:31,296 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684303924] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 23:40:31,296 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 23:40:31,296 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2025-02-05 23:40:31,296 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754179060]
[2025-02-05 23:40:31,296 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 23:40:31,297 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2025-02-05 23:40:31,298 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 23:40:31,299 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2025-02-05 23:40:31,299 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210
[2025-02-05 23:40:31,299 INFO  L87              Difference]: Start difference. First operand 509 states and 757 transitions. Second operand  has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31)
[2025-02-05 23:40:34,085 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 23:40:34,086 INFO  L93              Difference]: Finished difference Result 886 states and 1299 transitions.
[2025-02-05 23:40:34,086 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2025-02-05 23:40:34,087 INFO  L78                 Accepts]: Start accepts. Automaton has  has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 206
[2025-02-05 23:40:34,087 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 23:40:34,090 INFO  L225             Difference]: With dead ends: 886
[2025-02-05 23:40:34,091 INFO  L226             Difference]: Without dead ends: 676
[2025-02-05 23:40:34,092 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=277, Invalid=983, Unknown=0, NotChecked=0, Total=1260
[2025-02-05 23:40:34,093 INFO  L435           NwaCegarLoop]: 146 mSDtfsCounter, 667 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-02-05 23:40:34,094 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 1112 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-02-05 23:40:34,095 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 676 states.
[2025-02-05 23:40:34,121 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 525.
[2025-02-05 23:40:34,123 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 525 states, 444 states have (on average 1.4301801801801801) internal successors, (635), 445 states have internal predecessors, (635), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72)
[2025-02-05 23:40:34,125 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 779 transitions.
[2025-02-05 23:40:34,126 INFO  L78                 Accepts]: Start accepts. Automaton has 525 states and 779 transitions. Word has length 206
[2025-02-05 23:40:34,127 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 23:40:34,127 INFO  L471      AbstractCegarLoop]: Abstraction has 525 states and 779 transitions.
[2025-02-05 23:40:34,127 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31)
[2025-02-05 23:40:34,127 INFO  L276                IsEmpty]: Start isEmpty. Operand 525 states and 779 transitions.
[2025-02-05 23:40:34,129 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 207
[2025-02-05 23:40:34,129 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 23:40:34,129 INFO  L218           NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:40:34,129 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-05 23:40:34,129 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 23:40:34,130 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 23:40:34,130 INFO  L85        PathProgramCache]: Analyzing trace with hash -1828504917, now seen corresponding path program 1 times
[2025-02-05 23:40:34,130 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 23:40:34,130 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175273744]
[2025-02-05 23:40:34,130 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 23:40:34,130 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 23:40:34,143 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes.
[2025-02-05 23:40:34,206 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements.
[2025-02-05 23:40:34,209 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 23:40:34,209 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 23:40:40,085 INFO  L134       CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked.
[2025-02-05 23:40:40,086 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 23:40:40,086 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175273744]
[2025-02-05 23:40:40,086 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175273744] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 23:40:40,086 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 23:40:40,086 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2025-02-05 23:40:40,086 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664696374]
[2025-02-05 23:40:40,086 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 23:40:40,086 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2025-02-05 23:40:40,086 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 23:40:40,087 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2025-02-05 23:40:40,087 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210
[2025-02-05 23:40:40,087 INFO  L87              Difference]: Start difference. First operand 525 states and 779 transitions. Second operand  has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-02-05 23:40:45,677 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 23:40:45,677 INFO  L93              Difference]: Finished difference Result 907 states and 1315 transitions.
[2025-02-05 23:40:45,678 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. 
[2025-02-05 23:40:45,678 INFO  L78                 Accepts]: Start accepts. Automaton has  has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206
[2025-02-05 23:40:45,678 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 23:40:45,681 INFO  L225             Difference]: With dead ends: 907
[2025-02-05 23:40:45,681 INFO  L226             Difference]: Without dead ends: 697
[2025-02-05 23:40:45,683 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=438, Invalid=1454, Unknown=0, NotChecked=0, Total=1892
[2025-02-05 23:40:45,684 INFO  L435           NwaCegarLoop]: 165 mSDtfsCounter, 507 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-02-05 23:40:45,685 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 1258 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-02-05 23:40:45,686 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 697 states.
[2025-02-05 23:40:45,718 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 545.
[2025-02-05 23:40:45,719 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 545 states, 461 states have (on average 1.4273318872017353) internal successors, (658), 462 states have internal predecessors, (658), 74 states have call successors, (74), 9 states have call predecessors, (74), 9 states have return successors, (74), 73 states have call predecessors, (74), 74 states have call successors, (74)
[2025-02-05 23:40:45,721 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 806 transitions.
[2025-02-05 23:40:45,722 INFO  L78                 Accepts]: Start accepts. Automaton has 545 states and 806 transitions. Word has length 206
[2025-02-05 23:40:45,722 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 23:40:45,722 INFO  L471      AbstractCegarLoop]: Abstraction has 545 states and 806 transitions.
[2025-02-05 23:40:45,722 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-02-05 23:40:45,723 INFO  L276                IsEmpty]: Start isEmpty. Operand 545 states and 806 transitions.
[2025-02-05 23:40:45,724 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 207
[2025-02-05 23:40:45,724 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 23:40:45,724 INFO  L218           NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:40:45,724 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-02-05 23:40:45,724 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 23:40:45,725 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 23:40:45,725 INFO  L85        PathProgramCache]: Analyzing trace with hash -2025018422, now seen corresponding path program 1 times
[2025-02-05 23:40:45,725 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 23:40:45,725 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227172150]
[2025-02-05 23:40:45,725 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 23:40:45,725 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 23:40:45,737 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes.
[2025-02-05 23:40:45,793 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements.
[2025-02-05 23:40:45,793 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 23:40:45,793 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 23:40:52,769 INFO  L134       CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked.
[2025-02-05 23:40:52,769 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 23:40:52,769 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227172150]
[2025-02-05 23:40:52,769 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227172150] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 23:40:52,769 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 23:40:52,769 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2025-02-05 23:40:52,769 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534549785]
[2025-02-05 23:40:52,769 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 23:40:52,770 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-02-05 23:40:52,770 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 23:40:52,770 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-02-05 23:40:52,770 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182
[2025-02-05 23:40:52,771 INFO  L87              Difference]: Start difference. First operand 545 states and 806 transitions. Second operand  has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-02-05 23:40:54,384 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 23:40:54,385 INFO  L93              Difference]: Finished difference Result 879 states and 1284 transitions.
[2025-02-05 23:40:54,385 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2025-02-05 23:40:54,385 INFO  L78                 Accepts]: Start accepts. Automaton has  has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206
[2025-02-05 23:40:54,386 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 23:40:54,389 INFO  L225             Difference]: With dead ends: 879
[2025-02-05 23:40:54,389 INFO  L226             Difference]: Without dead ends: 665
[2025-02-05 23:40:54,391 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=203, Invalid=609, Unknown=0, NotChecked=0, Total=812
[2025-02-05 23:40:54,391 INFO  L435           NwaCegarLoop]: 147 mSDtfsCounter, 503 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 23:40:54,391 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 913 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 23:40:54,392 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 665 states.
[2025-02-05 23:40:54,422 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 553.
[2025-02-05 23:40:54,423 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 553 states, 469 states have (on average 1.4264392324093818) internal successors, (669), 470 states have internal predecessors, (669), 74 states have call successors, (74), 9 states have call predecessors, (74), 9 states have return successors, (74), 73 states have call predecessors, (74), 74 states have call successors, (74)
[2025-02-05 23:40:54,425 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 817 transitions.
[2025-02-05 23:40:54,426 INFO  L78                 Accepts]: Start accepts. Automaton has 553 states and 817 transitions. Word has length 206
[2025-02-05 23:40:54,426 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 23:40:54,426 INFO  L471      AbstractCegarLoop]: Abstraction has 553 states and 817 transitions.
[2025-02-05 23:40:54,426 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)
[2025-02-05 23:40:54,427 INFO  L276                IsEmpty]: Start isEmpty. Operand 553 states and 817 transitions.
[2025-02-05 23:40:54,428 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 207
[2025-02-05 23:40:54,428 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 23:40:54,428 INFO  L218           NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:40:54,428 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-02-05 23:40:54,429 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 23:40:54,429 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 23:40:54,429 INFO  L85        PathProgramCache]: Analyzing trace with hash 1279484746, now seen corresponding path program 1 times
[2025-02-05 23:40:54,429 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 23:40:54,429 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979942064]
[2025-02-05 23:40:54,429 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 23:40:54,430 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 23:40:54,440 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes.
[2025-02-05 23:40:54,475 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements.
[2025-02-05 23:40:54,475 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 23:40:54,475 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat