./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-33.i --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version 798a7b37
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-33.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a748a59f07e4b223740bdd1b062749131146e39483e646914db65f28461caf78
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-03 20:51:05,616 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-03 20:51:05,656 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-03 20:51:05,660 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-03 20:51:05,661 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-03 20:51:05,680 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-03 20:51:05,681 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-03 20:51:05,681 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-03 20:51:05,681 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-03 20:51:05,682 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-03 20:51:05,682 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-03 20:51:05,682 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-03 20:51:05,682 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-03 20:51:05,682 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-03 20:51:05,682 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-03 20:51:05,682 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-03 20:51:05,682 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-03 20:51:05,682 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-03 20:51:05,683 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-03 20:51:05,683 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-03 20:51:05,684 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-03 20:51:05,684 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-03 20:51:05,684 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-03 20:51:05,684 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-03 20:51:05,684 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-03 20:51:05,684 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-03 20:51:05,684 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-03 20:51:05,684 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-03 20:51:05,684 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-03 20:51:05,684 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-03 20:51:05,685 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-03 20:51:05,685 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-03 20:51:05,685 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 20:51:05,685 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-03 20:51:05,685 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-03 20:51:05,685 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-03 20:51:05,685 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-03 20:51:05,685 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-03 20:51:05,685 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-03 20:51:05,685 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-03 20:51:05,685 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-03 20:51:05,685 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-03 20:51:05,686 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-03 20:51:05,686 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/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 -> a748a59f07e4b223740bdd1b062749131146e39483e646914db65f28461caf78
[2025-03-03 20:51:05,885 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 20:51:05,893 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 20:51:05,894 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 20:51:05,896 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 20:51:05,896 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 20:51:05,897 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-33.i
[2025-03-03 20:51:07,055 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a20dd468/0e1e988f843f403ca37e5ea5a3c4ffb5/FLAGc2d4b2ddd
[2025-03-03 20:51:07,321 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 20:51:07,321 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-33.i
[2025-03-03 20:51:07,327 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a20dd468/0e1e988f843f403ca37e5ea5a3c4ffb5/FLAGc2d4b2ddd
[2025-03-03 20:51:07,626 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a20dd468/0e1e988f843f403ca37e5ea5a3c4ffb5
[2025-03-03 20:51:07,627 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 20:51:07,628 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 20:51:07,630 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 20:51:07,630 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 20:51:07,634 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 20:51:07,635 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:51:07" (1/1) ...
[2025-03-03 20:51:07,635 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c621b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:07, skipping insertion in model container
[2025-03-03 20:51:07,636 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:51:07" (1/1) ...
[2025-03-03 20:51:07,647 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 20:51:07,754 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-33.i[919,932]
[2025-03-03 20:51:07,806 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 20:51:07,815 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 20:51:07,822 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-33.i[919,932]
[2025-03-03 20:51:07,851 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 20:51:07,864 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 20:51:07,864 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:07 WrapperNode
[2025-03-03 20:51:07,864 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 20:51:07,865 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 20:51:07,865 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 20:51:07,865 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 20:51:07,869 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:07" (1/1) ...
[2025-03-03 20:51:07,876 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:07" (1/1) ...
[2025-03-03 20:51:07,911 INFO  L138                Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 223
[2025-03-03 20:51:07,912 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 20:51:07,912 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 20:51:07,912 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 20:51:07,912 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 20:51:07,919 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:07" (1/1) ...
[2025-03-03 20:51:07,919 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:07" (1/1) ...
[2025-03-03 20:51:07,926 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:07" (1/1) ...
[2025-03-03 20:51:07,948 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-03-03 20:51:07,949 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:07" (1/1) ...
[2025-03-03 20:51:07,950 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:07" (1/1) ...
[2025-03-03 20:51:07,957 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:07" (1/1) ...
[2025-03-03 20:51:07,959 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:07" (1/1) ...
[2025-03-03 20:51:07,960 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:07" (1/1) ...
[2025-03-03 20:51:07,965 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:07" (1/1) ...
[2025-03-03 20:51:07,968 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 20:51:07,968 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 20:51:07,968 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 20:51:07,971 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 20:51:07,972 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:07" (1/1) ...
[2025-03-03 20:51:07,976 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 20:51:07,985 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 20:51:07,998 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-03 20:51:08,001 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-03 20:51:08,017 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 20:51:08,018 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-03 20:51:08,018 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-03 20:51:08,018 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 20:51:08,018 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 20:51:08,018 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 20:51:08,081 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 20:51:08,083 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 20:51:08,377 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L184: havoc property_#t~ite23#1;havoc property_#t~bitwise22#1;
[2025-03-03 20:51:08,406 INFO  L?                        ?]: Removed 15 outVars from TransFormulas that were not future-live.
[2025-03-03 20:51:08,407 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 20:51:08,418 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 20:51:08,418 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 20:51:08,419 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:51:08 BoogieIcfgContainer
[2025-03-03 20:51:08,419 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 20:51:08,422 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 20:51:08,423 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 20:51:08,426 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 20:51:08,426 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:51:07" (1/3) ...
[2025-03-03 20:51:08,426 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a0f0d27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:51:08, skipping insertion in model container
[2025-03-03 20:51:08,426 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:07" (2/3) ...
[2025-03-03 20:51:08,426 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a0f0d27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:51:08, skipping insertion in model container
[2025-03-03 20:51:08,426 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:51:08" (3/3) ...
[2025-03-03 20:51:08,427 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-33.i
[2025-03-03 20:51:08,437 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 20:51:08,438 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-33.i that has 2 procedures, 99 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 20:51:08,478 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 20:51:08,486 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;@5aa9f8f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 20:51:08,486 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 20:51:08,489 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 99 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 63 states have internal predecessors, (88), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34)
[2025-03-03 20:51:08,501 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 214
[2025-03-03 20:51:08,501 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 20:51:08,502 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 20:51:08,502 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 20:51:08,506 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 20:51:08,506 INFO  L85        PathProgramCache]: Analyzing trace with hash 1239694609, now seen corresponding path program 1 times
[2025-03-03 20:51:08,511 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 20:51:08,511 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422236336]
[2025-03-03 20:51:08,511 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 20:51:08,512 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 20:51:08,584 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes.
[2025-03-03 20:51:08,610 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements.
[2025-03-03 20:51:08,610 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 20:51:08,611 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 20:51:08,800 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked.
[2025-03-03 20:51:08,801 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 20:51:08,801 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422236336]
[2025-03-03 20:51:08,801 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422236336] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 20:51:08,801 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703699122]
[2025-03-03 20:51:08,802 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 20:51:08,802 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 20:51:08,802 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 20:51:08,804 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 20:51:08,805 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-03 20:51:08,873 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes.
[2025-03-03 20:51:08,937 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements.
[2025-03-03 20:51:08,937 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 20:51:08,937 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 20:51:08,940 INFO  L256         TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-03 20:51:08,948 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 20:51:08,971 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked.
[2025-03-03 20:51:08,971 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 20:51:08,971 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [703699122] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 20:51:08,971 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 20:51:08,972 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-03-03 20:51:08,973 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479712375]
[2025-03-03 20:51:08,974 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 20:51:08,976 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-03 20:51:08,976 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 20:51:08,991 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-03 20:51:08,993 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-03 20:51:08,995 INFO  L87              Difference]: Start difference. First operand  has 99 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 63 states have internal predecessors, (88), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand  has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34)
[2025-03-03 20:51:09,029 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 20:51:09,030 INFO  L93              Difference]: Finished difference Result 190 states and 337 transitions.
[2025-03-03 20:51:09,031 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-03 20:51:09,032 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 213
[2025-03-03 20:51:09,032 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 20:51:09,037 INFO  L225             Difference]: With dead ends: 190
[2025-03-03 20:51:09,037 INFO  L226             Difference]: Without dead ends: 94
[2025-03-03 20:51:09,039 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 214 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-03-03 20:51:09,041 INFO  L435           NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 20:51:09,042 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 20:51:09,050 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 94 states.
[2025-03-03 20:51:09,070 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94.
[2025-03-03 20:51:09,071 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 94 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 58 states have internal predecessors, (76), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34)
[2025-03-03 20:51:09,075 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 144 transitions.
[2025-03-03 20:51:09,076 INFO  L78                 Accepts]: Start accepts. Automaton has 94 states and 144 transitions. Word has length 213
[2025-03-03 20:51:09,077 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 20:51:09,077 INFO  L471      AbstractCegarLoop]: Abstraction has 94 states and 144 transitions.
[2025-03-03 20:51:09,077 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34)
[2025-03-03 20:51:09,077 INFO  L276                IsEmpty]: Start isEmpty. Operand 94 states and 144 transitions.
[2025-03-03 20:51:09,080 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 214
[2025-03-03 20:51:09,080 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 20:51:09,080 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 20:51:09,087 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-03 20:51:09,284 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0
[2025-03-03 20:51:09,284 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 20:51:09,285 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 20:51:09,285 INFO  L85        PathProgramCache]: Analyzing trace with hash 109496463, now seen corresponding path program 1 times
[2025-03-03 20:51:09,285 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 20:51:09,285 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041646139]
[2025-03-03 20:51:09,285 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 20:51:09,285 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 20:51:09,304 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes.
[2025-03-03 20:51:09,483 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements.
[2025-03-03 20:51:09,484 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 20:51:09,484 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 20:51:16,214 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-03 20:51:16,215 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 20:51:16,215 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041646139]
[2025-03-03 20:51:16,216 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041646139] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 20:51:16,216 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 20:51:16,216 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-03 20:51:16,216 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619537881]
[2025-03-03 20:51:16,216 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 20:51:16,217 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-03 20:51:16,217 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 20:51:16,217 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-03 20:51:16,218 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2025-03-03 20:51:16,218 INFO  L87              Difference]: Start difference. First operand 94 states and 144 transitions. Second operand  has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-03 20:51:18,279 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 20:51:18,279 INFO  L93              Difference]: Finished difference Result 637 states and 965 transitions.
[2025-03-03 20:51:18,279 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2025-03-03 20:51:18,280 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 213
[2025-03-03 20:51:18,280 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 20:51:18,284 INFO  L225             Difference]: With dead ends: 637
[2025-03-03 20:51:18,284 INFO  L226             Difference]: Without dead ends: 546
[2025-03-03 20:51:18,285 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342
[2025-03-03 20:51:18,285 INFO  L435           NwaCegarLoop]: 312 mSDtfsCounter, 692 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-03 20:51:18,285 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 954 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-03 20:51:18,286 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 546 states.
[2025-03-03 20:51:18,363 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 504.
[2025-03-03 20:51:18,364 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 504 states, 325 states have (on average 1.32) internal successors, (429), 325 states have internal predecessors, (429), 170 states have call successors, (170), 8 states have call predecessors, (170), 8 states have return successors, (170), 170 states have call predecessors, (170), 170 states have call successors, (170)
[2025-03-03 20:51:18,368 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 769 transitions.
[2025-03-03 20:51:18,368 INFO  L78                 Accepts]: Start accepts. Automaton has 504 states and 769 transitions. Word has length 213
[2025-03-03 20:51:18,369 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 20:51:18,369 INFO  L471      AbstractCegarLoop]: Abstraction has 504 states and 769 transitions.
[2025-03-03 20:51:18,369 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-03 20:51:18,369 INFO  L276                IsEmpty]: Start isEmpty. Operand 504 states and 769 transitions.
[2025-03-03 20:51:18,371 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 214
[2025-03-03 20:51:18,371 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 20:51:18,371 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 20:51:18,371 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 20:51:18,372 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 20:51:18,372 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 20:51:18,372 INFO  L85        PathProgramCache]: Analyzing trace with hash -183906544, now seen corresponding path program 1 times
[2025-03-03 20:51:18,372 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 20:51:18,372 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735564023]
[2025-03-03 20:51:18,372 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 20:51:18,373 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 20:51:18,386 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes.
[2025-03-03 20:51:18,438 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements.
[2025-03-03 20:51:18,439 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 20:51:18,439 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 20:51:18,685 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-03 20:51:18,685 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 20:51:18,686 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735564023]
[2025-03-03 20:51:18,686 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735564023] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 20:51:18,686 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 20:51:18,686 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 20:51:18,686 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796012784]
[2025-03-03 20:51:18,686 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 20:51:18,686 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 20:51:18,686 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 20:51:18,687 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 20:51:18,687 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 20:51:18,687 INFO  L87              Difference]: Start difference. First operand 504 states and 769 transitions. Second operand  has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-03 20:51:18,949 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 20:51:18,950 INFO  L93              Difference]: Finished difference Result 1011 states and 1527 transitions.
[2025-03-03 20:51:18,950 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 20:51:18,950 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 213
[2025-03-03 20:51:18,951 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 20:51:18,956 INFO  L225             Difference]: With dead ends: 1011
[2025-03-03 20:51:18,957 INFO  L226             Difference]: Without dead ends: 570
[2025-03-03 20:51:18,959 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-03-03 20:51:18,961 INFO  L435           NwaCegarLoop]: 128 mSDtfsCounter, 87 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 20:51:18,961 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 362 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 20:51:18,962 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 570 states.
[2025-03-03 20:51:19,007 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 534.
[2025-03-03 20:51:19,009 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 534 states, 355 states have (on average 1.3183098591549296) internal successors, (468), 355 states have internal predecessors, (468), 170 states have call successors, (170), 8 states have call predecessors, (170), 8 states have return successors, (170), 170 states have call predecessors, (170), 170 states have call successors, (170)
[2025-03-03 20:51:19,013 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 808 transitions.
[2025-03-03 20:51:19,014 INFO  L78                 Accepts]: Start accepts. Automaton has 534 states and 808 transitions. Word has length 213
[2025-03-03 20:51:19,015 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 20:51:19,015 INFO  L471      AbstractCegarLoop]: Abstraction has 534 states and 808 transitions.
[2025-03-03 20:51:19,016 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-03 20:51:19,016 INFO  L276                IsEmpty]: Start isEmpty. Operand 534 states and 808 transitions.
[2025-03-03 20:51:19,019 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 216
[2025-03-03 20:51:19,019 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 20:51:19,019 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 20:51:19,019 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-03 20:51:19,020 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 20:51:19,020 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 20:51:19,020 INFO  L85        PathProgramCache]: Analyzing trace with hash 809272185, now seen corresponding path program 1 times
[2025-03-03 20:51:19,020 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 20:51:19,020 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083791467]
[2025-03-03 20:51:19,020 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 20:51:19,020 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 20:51:19,029 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes.
[2025-03-03 20:51:19,102 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements.
[2025-03-03 20:51:19,102 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 20:51:19,102 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 20:51:26,408 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-03 20:51:26,409 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 20:51:26,409 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083791467]
[2025-03-03 20:51:26,409 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083791467] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 20:51:26,409 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 20:51:26,409 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2025-03-03 20:51:26,409 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711087414]
[2025-03-03 20:51:26,409 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 20:51:26,410 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2025-03-03 20:51:26,410 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 20:51:26,410 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2025-03-03 20:51:26,411 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210
[2025-03-03 20:51:26,411 INFO  L87              Difference]: Start difference. First operand 534 states and 808 transitions. Second operand  has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-03 20:51:28,673 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 20:51:28,674 INFO  L93              Difference]: Finished difference Result 607 states and 888 transitions.
[2025-03-03 20:51:28,675 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2025-03-03 20:51:28,675 INFO  L78                 Accepts]: Start accepts. Automaton has  has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215
[2025-03-03 20:51:28,676 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 20:51:28,679 INFO  L225             Difference]: With dead ends: 607
[2025-03-03 20:51:28,679 INFO  L226             Difference]: Without dead ends: 605
[2025-03-03 20:51:28,679 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756
[2025-03-03 20:51:28,680 INFO  L435           NwaCegarLoop]: 107 mSDtfsCounter, 438 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-03 20:51:28,680 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 692 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-03 20:51:28,681 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 605 states.
[2025-03-03 20:51:28,722 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 552.
[2025-03-03 20:51:28,724 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 552 states, 373 states have (on average 1.3136729222520107) internal successors, (490), 373 states have internal predecessors, (490), 170 states have call successors, (170), 8 states have call predecessors, (170), 8 states have return successors, (170), 170 states have call predecessors, (170), 170 states have call successors, (170)
[2025-03-03 20:51:28,726 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 830 transitions.
[2025-03-03 20:51:28,727 INFO  L78                 Accepts]: Start accepts. Automaton has 552 states and 830 transitions. Word has length 215
[2025-03-03 20:51:28,727 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 20:51:28,727 INFO  L471      AbstractCegarLoop]: Abstraction has 552 states and 830 transitions.
[2025-03-03 20:51:28,727 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-03 20:51:28,728 INFO  L276                IsEmpty]: Start isEmpty. Operand 552 states and 830 transitions.
[2025-03-03 20:51:28,729 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 216
[2025-03-03 20:51:28,729 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 20:51:28,729 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 20:51:28,729 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-03 20:51:28,729 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 20:51:28,730 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 20:51:28,730 INFO  L85        PathProgramCache]: Analyzing trace with hash -1838982407, now seen corresponding path program 1 times
[2025-03-03 20:51:28,730 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 20:51:28,730 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247975913]
[2025-03-03 20:51:28,730 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 20:51:28,730 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 20:51:28,738 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes.
[2025-03-03 20:51:28,778 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements.
[2025-03-03 20:51:28,778 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 20:51:28,778 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 20:51:33,863 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-03 20:51:33,863 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 20:51:33,863 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247975913]
[2025-03-03 20:51:33,863 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247975913] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 20:51:33,863 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 20:51:33,863 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-03 20:51:33,863 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887304766]
[2025-03-03 20:51:33,863 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 20:51:33,864 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-03 20:51:33,864 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 20:51:33,864 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-03 20:51:33,864 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-03-03 20:51:33,864 INFO  L87              Difference]: Start difference. First operand 552 states and 830 transitions. Second operand  has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-03 20:51:35,797 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 20:51:35,797 INFO  L93              Difference]: Finished difference Result 1040 states and 1545 transitions.
[2025-03-03 20:51:35,798 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-03-03 20:51:35,798 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215
[2025-03-03 20:51:35,798 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 20:51:35,801 INFO  L225             Difference]: With dead ends: 1040
[2025-03-03 20:51:35,801 INFO  L226             Difference]: Without dead ends: 630
[2025-03-03 20:51:35,803 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272
[2025-03-03 20:51:35,803 INFO  L435           NwaCegarLoop]: 266 mSDtfsCounter, 483 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-03 20:51:35,803 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 869 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-03 20:51:35,804 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 630 states.
[2025-03-03 20:51:35,835 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 552.
[2025-03-03 20:51:35,836 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 552 states, 373 states have (on average 1.3029490616621984) internal successors, (486), 373 states have internal predecessors, (486), 170 states have call successors, (170), 8 states have call predecessors, (170), 8 states have return successors, (170), 170 states have call predecessors, (170), 170 states have call successors, (170)
[2025-03-03 20:51:35,838 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 826 transitions.
[2025-03-03 20:51:35,839 INFO  L78                 Accepts]: Start accepts. Automaton has 552 states and 826 transitions. Word has length 215
[2025-03-03 20:51:35,839 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 20:51:35,839 INFO  L471      AbstractCegarLoop]: Abstraction has 552 states and 826 transitions.
[2025-03-03 20:51:35,840 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-03 20:51:35,840 INFO  L276                IsEmpty]: Start isEmpty. Operand 552 states and 826 transitions.
[2025-03-03 20:51:35,841 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 216
[2025-03-03 20:51:35,841 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 20:51:35,841 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 20:51:35,841 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-03 20:51:35,842 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 20:51:35,842 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 20:51:35,842 INFO  L85        PathProgramCache]: Analyzing trace with hash -2132385414, now seen corresponding path program 1 times
[2025-03-03 20:51:35,842 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 20:51:35,842 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307544479]
[2025-03-03 20:51:35,842 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 20:51:35,842 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 20:51:35,853 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes.
[2025-03-03 20:51:35,922 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements.
[2025-03-03 20:51:35,922 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 20:51:35,922 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 20:51:36,116 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 69 proven. 30 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked.
[2025-03-03 20:51:36,117 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 20:51:36,117 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307544479]
[2025-03-03 20:51:36,117 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307544479] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 20:51:36,117 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248023183]
[2025-03-03 20:51:36,117 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 20:51:36,117 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 20:51:36,118 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 20:51:36,120 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 20:51:36,122 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-03-03 20:51:36,167 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes.
[2025-03-03 20:51:36,220 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements.
[2025-03-03 20:51:36,220 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 20:51:36,220 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 20:51:36,222 INFO  L256         TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 42 conjuncts are in the unsatisfiable core
[2025-03-03 20:51:36,232 INFO  L279         TraceCheckSpWp]: Computing forward predicates...