./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-92.i --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version e2fb8bed
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_loopvsstraightlinecode_100-1loop_file-92.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 41ccaa2c6661b48b1b98db087da596eaf2b2fd6514e04327794ac67bb63454b3
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 14:04:21,631 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 14:04:21,683 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-08 14:04:21,687 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 14:04:21,687 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 14:04:21,713 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 14:04:21,717 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 14:04:21,717 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 14:04:21,717 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 14:04:21,717 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 14:04:21,717 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 14:04:21,717 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 14:04:21,717 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 14:04:21,718 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 14:04:21,718 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 14:04:21,718 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 14:04:21,718 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 14:04:21,718 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-08 14:04:21,718 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-08 14:04:21,718 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-08 14:04:21,718 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 14:04:21,718 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 14:04:21,718 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 14:04:21,718 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 14:04:21,718 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-08 14:04:21,718 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 14:04:21,718 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 14:04:21,718 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 14:04:21,718 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 14:04:21,718 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 14:04:21,718 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 14:04:21,718 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 14:04:21,718 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 14:04:21,719 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 14:04:21,719 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 14:04:21,719 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 14:04:21,719 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 14:04:21,719 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-08 14:04:21,719 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-08 14:04:21,719 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 14:04:21,719 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 14:04:21,719 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 14:04:21,719 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 14:04:21,719 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 -> 41ccaa2c6661b48b1b98db087da596eaf2b2fd6514e04327794ac67bb63454b3
[2025-03-08 14:04:21,954 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 14:04:21,962 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 14:04:21,965 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 14:04:21,966 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 14:04:21,966 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 14:04:21,967 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-92.i
[2025-03-08 14:04:23,150 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09e941550/b411885422194a85b80fc7293485d9fa/FLAG02f6ee487
[2025-03-08 14:04:23,395 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 14:04:23,395 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-92.i
[2025-03-08 14:04:23,401 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09e941550/b411885422194a85b80fc7293485d9fa/FLAG02f6ee487
[2025-03-08 14:04:23,412 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09e941550/b411885422194a85b80fc7293485d9fa
[2025-03-08 14:04:23,414 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 14:04:23,415 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 14:04:23,416 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 14:04:23,416 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 14:04:23,419 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 14:04:23,419 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:04:23" (1/1) ...
[2025-03-08 14:04:23,420 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ed78ba6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:23, skipping insertion in model container
[2025-03-08 14:04:23,420 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:04:23" (1/1) ...
[2025-03-08 14:04:23,433 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 14:04:23,529 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_loopvsstraightlinecode_100-1loop_file-92.i[916,929]
[2025-03-08 14:04:23,577 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 14:04:23,588 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 14:04:23,595 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_loopvsstraightlinecode_100-1loop_file-92.i[916,929]
[2025-03-08 14:04:23,623 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 14:04:23,635 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 14:04:23,636 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:23 WrapperNode
[2025-03-08 14:04:23,636 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 14:04:23,637 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 14:04:23,637 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 14:04:23,637 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 14:04:23,641 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:23" (1/1) ...
[2025-03-08 14:04:23,654 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:23" (1/1) ...
[2025-03-08 14:04:23,689 INFO  L138                Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 312
[2025-03-08 14:04:23,690 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 14:04:23,690 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 14:04:23,691 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 14:04:23,691 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 14:04:23,697 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:23" (1/1) ...
[2025-03-08 14:04:23,697 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:23" (1/1) ...
[2025-03-08 14:04:23,705 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:23" (1/1) ...
[2025-03-08 14:04:23,729 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-08 14:04:23,730 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:23" (1/1) ...
[2025-03-08 14:04:23,731 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:23" (1/1) ...
[2025-03-08 14:04:23,743 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:23" (1/1) ...
[2025-03-08 14:04:23,745 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:23" (1/1) ...
[2025-03-08 14:04:23,748 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:23" (1/1) ...
[2025-03-08 14:04:23,750 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:23" (1/1) ...
[2025-03-08 14:04:23,755 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 14:04:23,756 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 14:04:23,756 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 14:04:23,756 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 14:04:23,758 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:23" (1/1) ...
[2025-03-08 14:04:23,763 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 14:04:23,773 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 14:04:23,784 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-08 14:04:23,787 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-08 14:04:23,806 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 14:04:23,806 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-08 14:04:23,806 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-08 14:04:23,806 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-08 14:04:23,806 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 14:04:23,806 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 14:04:23,875 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 14:04:23,876 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 14:04:24,275 INFO  L1307  $ProcedureCfgBuilder]: dead code at ProgramPoint L194: havoc property_#t~bitwise22#1;havoc property_#t~short23#1;havoc property_#t~ite27#1;havoc property_#t~bitwise24#1;havoc property_#t~ite26#1;havoc property_#t~bitwise25#1;havoc property_#t~short28#1;havoc property_#t~bitwise29#1;havoc property_#t~short30#1;havoc property_#t~ite32#1;havoc property_#t~bitwise31#1;havoc property_#t~short33#1;
[2025-03-08 14:04:24,310 INFO  L?                        ?]: Removed 46 outVars from TransFormulas that were not future-live.
[2025-03-08 14:04:24,310 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 14:04:24,333 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 14:04:24,333 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 14:04:24,333 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:04:24 BoogieIcfgContainer
[2025-03-08 14:04:24,333 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 14:04:24,338 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 14:04:24,338 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 14:04:24,341 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 14:04:24,341 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:04:23" (1/3) ...
[2025-03-08 14:04:24,342 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ba8f8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:04:24, skipping insertion in model container
[2025-03-08 14:04:24,342 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:23" (2/3) ...
[2025-03-08 14:04:24,342 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ba8f8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:04:24, skipping insertion in model container
[2025-03-08 14:04:24,342 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:04:24" (3/3) ...
[2025-03-08 14:04:24,343 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-92.i
[2025-03-08 14:04:24,353 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 14:04:24,355 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-92.i that has 2 procedures, 126 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 14:04:24,406 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 14:04:24,416 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;@52a69ca6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 14:04:24,417 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 14:04:24,421 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 126 states, 101 states have (on average 1.495049504950495) internal successors, (151), 102 states have internal predecessors, (151), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22)
[2025-03-08 14:04:24,437 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 160
[2025-03-08 14:04:24,437 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 14:04:24,438 INFO  L218           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:04:24,439 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 14:04:24,443 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 14:04:24,444 INFO  L85        PathProgramCache]: Analyzing trace with hash 1282591107, now seen corresponding path program 1 times
[2025-03-08 14:04:24,449 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 14:04:24,450 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330359350]
[2025-03-08 14:04:24,451 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 14:04:24,452 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 14:04:24,527 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes.
[2025-03-08 14:04:24,549 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements.
[2025-03-08 14:04:24,552 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 14:04:24,552 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 14:04:24,731 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked.
[2025-03-08 14:04:24,732 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 14:04:24,733 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330359350]
[2025-03-08 14:04:24,735 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330359350] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 14:04:24,735 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829493899]
[2025-03-08 14:04:24,735 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 14:04:24,735 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 14:04:24,735 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 14:04:24,737 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-08 14:04:24,738 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-08 14:04:24,815 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes.
[2025-03-08 14:04:24,864 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements.
[2025-03-08 14:04:24,864 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 14:04:24,864 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 14:04:24,867 INFO  L256         TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-08 14:04:24,873 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 14:04:24,894 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked.
[2025-03-08 14:04:24,895 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 14:04:24,895 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [829493899] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 14:04:24,895 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 14:04:24,895 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-03-08 14:04:24,899 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752874831]
[2025-03-08 14:04:24,899 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 14:04:24,902 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-08 14:04:24,903 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 14:04:24,918 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-08 14:04:24,919 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 14:04:24,920 INFO  L87              Difference]: Start difference. First operand  has 126 states, 101 states have (on average 1.495049504950495) internal successors, (151), 102 states have internal predecessors, (151), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand  has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22)
[2025-03-08 14:04:24,959 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 14:04:24,959 INFO  L93              Difference]: Finished difference Result 249 states and 409 transitions.
[2025-03-08 14:04:24,960 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-08 14:04:24,962 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 159
[2025-03-08 14:04:24,962 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 14:04:24,969 INFO  L225             Difference]: With dead ends: 249
[2025-03-08 14:04:24,970 INFO  L226             Difference]: Without dead ends: 123
[2025-03-08 14:04:24,972 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 160 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-08 14:04:24,977 INFO  L435           NwaCegarLoop]: 183 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 14:04:24,979 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 14:04:24,988 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 123 states.
[2025-03-08 14:04:25,011 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123.
[2025-03-08 14:04:25,013 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 123 states, 99 states have (on average 1.4747474747474747) internal successors, (146), 99 states have internal predecessors, (146), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22)
[2025-03-08 14:04:25,016 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 190 transitions.
[2025-03-08 14:04:25,020 INFO  L78                 Accepts]: Start accepts. Automaton has 123 states and 190 transitions. Word has length 159
[2025-03-08 14:04:25,021 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 14:04:25,021 INFO  L471      AbstractCegarLoop]: Abstraction has 123 states and 190 transitions.
[2025-03-08 14:04:25,021 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22)
[2025-03-08 14:04:25,021 INFO  L276                IsEmpty]: Start isEmpty. Operand 123 states and 190 transitions.
[2025-03-08 14:04:25,024 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 160
[2025-03-08 14:04:25,026 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 14:04:25,026 INFO  L218           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:04:25,033 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-08 14:04:25,226 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-08 14:04:25,227 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 14:04:25,227 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 14:04:25,227 INFO  L85        PathProgramCache]: Analyzing trace with hash 1010784005, now seen corresponding path program 1 times
[2025-03-08 14:04:25,227 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 14:04:25,228 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744571647]
[2025-03-08 14:04:25,228 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 14:04:25,228 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 14:04:25,240 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes.
[2025-03-08 14:04:25,299 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements.
[2025-03-08 14:04:25,300 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 14:04:25,301 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 14:04:25,633 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked.
[2025-03-08 14:04:25,633 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 14:04:25,633 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744571647]
[2025-03-08 14:04:25,634 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744571647] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 14:04:25,634 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 14:04:25,634 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 14:04:25,634 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86457982]
[2025-03-08 14:04:25,634 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 14:04:25,634 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 14:04:25,634 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 14:04:25,635 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 14:04:25,635 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 14:04:25,635 INFO  L87              Difference]: Start difference. First operand 123 states and 190 transitions. Second operand  has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 14:04:25,750 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 14:04:25,751 INFO  L93              Difference]: Finished difference Result 363 states and 564 transitions.
[2025-03-08 14:04:25,751 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 14:04:25,752 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 159
[2025-03-08 14:04:25,752 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 14:04:25,754 INFO  L225             Difference]: With dead ends: 363
[2025-03-08 14:04:25,756 INFO  L226             Difference]: Without dead ends: 243
[2025-03-08 14:04:25,757 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-03-08 14:04:25,757 INFO  L435           NwaCegarLoop]: 243 mSDtfsCounter, 135 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 14:04:25,759 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 403 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 14:04:25,759 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 243 states.
[2025-03-08 14:04:25,790 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241.
[2025-03-08 14:04:25,791 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 241 states, 194 states have (on average 1.4742268041237114) internal successors, (286), 194 states have internal predecessors, (286), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44)
[2025-03-08 14:04:25,794 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 374 transitions.
[2025-03-08 14:04:25,797 INFO  L78                 Accepts]: Start accepts. Automaton has 241 states and 374 transitions. Word has length 159
[2025-03-08 14:04:25,797 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 14:04:25,797 INFO  L471      AbstractCegarLoop]: Abstraction has 241 states and 374 transitions.
[2025-03-08 14:04:25,797 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 14:04:25,797 INFO  L276                IsEmpty]: Start isEmpty. Operand 241 states and 374 transitions.
[2025-03-08 14:04:25,799 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 161
[2025-03-08 14:04:25,802 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 14:04:25,802 INFO  L218           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:04:25,803 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-08 14:04:25,803 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 14:04:25,803 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 14:04:25,803 INFO  L85        PathProgramCache]: Analyzing trace with hash 168322799, now seen corresponding path program 1 times
[2025-03-08 14:04:25,803 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 14:04:25,803 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207902202]
[2025-03-08 14:04:25,803 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 14:04:25,804 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 14:04:25,819 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes.
[2025-03-08 14:04:25,868 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements.
[2025-03-08 14:04:25,872 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 14:04:25,873 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 14:04:26,426 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked.
[2025-03-08 14:04:26,428 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 14:04:26,429 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207902202]
[2025-03-08 14:04:26,429 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207902202] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 14:04:26,429 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 14:04:26,429 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 14:04:26,429 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682298921]
[2025-03-08 14:04:26,429 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 14:04:26,429 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 14:04:26,430 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 14:04:26,430 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 14:04:26,430 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 14:04:26,431 INFO  L87              Difference]: Start difference. First operand 241 states and 374 transitions. Second operand  has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 14:04:27,295 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 14:04:27,296 INFO  L93              Difference]: Finished difference Result 1170 states and 1802 transitions.
[2025-03-08 14:04:27,296 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-08 14:04:27,296 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 160
[2025-03-08 14:04:27,297 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 14:04:27,302 INFO  L225             Difference]: With dead ends: 1170
[2025-03-08 14:04:27,302 INFO  L226             Difference]: Without dead ends: 1050
[2025-03-08 14:04:27,305 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90
[2025-03-08 14:04:27,306 INFO  L435           NwaCegarLoop]: 212 mSDtfsCounter, 1354 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1354 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-08 14:04:27,307 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1354 Valid, 949 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-08 14:04:27,309 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1050 states.
[2025-03-08 14:04:27,396 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 623.
[2025-03-08 14:04:27,398 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 623 states, 509 states have (on average 1.4852652259332024) internal successors, (756), 510 states have internal predecessors, (756), 108 states have call successors, (108), 5 states have call predecessors, (108), 5 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108)
[2025-03-08 14:04:27,403 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 972 transitions.
[2025-03-08 14:04:27,404 INFO  L78                 Accepts]: Start accepts. Automaton has 623 states and 972 transitions. Word has length 160
[2025-03-08 14:04:27,404 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 14:04:27,404 INFO  L471      AbstractCegarLoop]: Abstraction has 623 states and 972 transitions.
[2025-03-08 14:04:27,405 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 14:04:27,405 INFO  L276                IsEmpty]: Start isEmpty. Operand 623 states and 972 transitions.
[2025-03-08 14:04:27,407 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 161
[2025-03-08 14:04:27,407 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 14:04:27,407 INFO  L218           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:04:27,408 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-08 14:04:27,408 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 14:04:27,408 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 14:04:27,409 INFO  L85        PathProgramCache]: Analyzing trace with hash -1606052237, now seen corresponding path program 1 times
[2025-03-08 14:04:27,409 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 14:04:27,409 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74545849]
[2025-03-08 14:04:27,409 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 14:04:27,409 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 14:04:27,424 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes.
[2025-03-08 14:04:27,512 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements.
[2025-03-08 14:04:27,512 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 14:04:27,512 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 14:04:46,859 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked.
[2025-03-08 14:04:46,859 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 14:04:46,860 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74545849]
[2025-03-08 14:04:46,860 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74545849] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 14:04:46,860 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 14:04:46,860 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-08 14:04:46,861 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825659600]
[2025-03-08 14:04:46,861 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 14:04:46,861 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-08 14:04:46,861 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 14:04:46,862 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-08 14:04:46,862 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2025-03-08 14:04:46,862 INFO  L87              Difference]: Start difference. First operand 623 states and 972 transitions. Second operand  has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 14:04:51,690 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 14:04:51,691 INFO  L93              Difference]: Finished difference Result 1980 states and 3068 transitions.
[2025-03-08 14:04:51,692 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 14:04:51,692 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 160
[2025-03-08 14:04:51,693 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 14:04:51,703 INFO  L225             Difference]: With dead ends: 1980
[2025-03-08 14:04:51,703 INFO  L226             Difference]: Without dead ends: 1360
[2025-03-08 14:04:51,705 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110
[2025-03-08 14:04:51,705 INFO  L435           NwaCegarLoop]: 135 mSDtfsCounter, 307 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time
[2025-03-08 14:04:51,706 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 709 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time]
[2025-03-08 14:04:51,708 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1360 states.
[2025-03-08 14:04:51,749 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 830.
[2025-03-08 14:04:51,751 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 830 states, 716 states have (on average 1.5223463687150838) internal successors, (1090), 717 states have internal predecessors, (1090), 108 states have call successors, (108), 5 states have call predecessors, (108), 5 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108)
[2025-03-08 14:04:51,754 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1306 transitions.
[2025-03-08 14:04:51,755 INFO  L78                 Accepts]: Start accepts. Automaton has 830 states and 1306 transitions. Word has length 160
[2025-03-08 14:04:51,756 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 14:04:51,756 INFO  L471      AbstractCegarLoop]: Abstraction has 830 states and 1306 transitions.
[2025-03-08 14:04:51,756 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 14:04:51,756 INFO  L276                IsEmpty]: Start isEmpty. Operand 830 states and 1306 transitions.
[2025-03-08 14:04:51,757 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 161
[2025-03-08 14:04:51,757 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 14:04:51,757 INFO  L218           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:04:51,757 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-08 14:04:51,757 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 14:04:51,758 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 14:04:51,758 INFO  L85        PathProgramCache]: Analyzing trace with hash 650858770, now seen corresponding path program 1 times
[2025-03-08 14:04:51,758 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 14:04:51,758 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114049704]
[2025-03-08 14:04:51,758 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 14:04:51,758 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 14:04:51,773 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes.
[2025-03-08 14:04:51,836 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements.
[2025-03-08 14:04:51,836 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 14:04:51,836 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 14:04:55,423 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked.
[2025-03-08 14:04:55,423 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 14:04:55,423 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114049704]
[2025-03-08 14:04:55,423 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114049704] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 14:04:55,423 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 14:04:55,424 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-08 14:04:55,424 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962547477]
[2025-03-08 14:04:55,424 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 14:04:55,424 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-08 14:04:55,425 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 14:04:55,425 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-08 14:04:55,425 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2025-03-08 14:04:55,425 INFO  L87              Difference]: Start difference. First operand 830 states and 1306 transitions. Second operand  has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 14:04:57,957 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 14:04:57,957 INFO  L93              Difference]: Finished difference Result 2329 states and 3626 transitions.
[2025-03-08 14:04:57,958 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 14:04:57,958 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 160
[2025-03-08 14:04:57,959 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 14:04:57,964 INFO  L225             Difference]: With dead ends: 2329
[2025-03-08 14:04:57,964 INFO  L226             Difference]: Without dead ends: 1502
[2025-03-08 14:04:57,966 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2025-03-08 14:04:57,967 INFO  L435           NwaCegarLoop]: 159 mSDtfsCounter, 394 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-03-08 14:04:57,967 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 717 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-03-08 14:04:57,968 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1502 states.
[2025-03-08 14:04:58,014 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 830.
[2025-03-08 14:04:58,015 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 830 states, 716 states have (on average 1.5223463687150838) internal successors, (1090), 717 states have internal predecessors, (1090), 108 states have call successors, (108), 5 states have call predecessors, (108), 5 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108)
[2025-03-08 14:04:58,019 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1306 transitions.
[2025-03-08 14:04:58,021 INFO  L78                 Accepts]: Start accepts. Automaton has 830 states and 1306 transitions. Word has length 160
[2025-03-08 14:04:58,022 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 14:04:58,023 INFO  L471      AbstractCegarLoop]: Abstraction has 830 states and 1306 transitions.
[2025-03-08 14:04:58,023 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 14:04:58,023 INFO  L276                IsEmpty]: Start isEmpty. Operand 830 states and 1306 transitions.
[2025-03-08 14:04:58,025 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 161
[2025-03-08 14:04:58,025 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 14:04:58,026 INFO  L218           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:04:58,026 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-08 14:04:58,026 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 14:04:58,026 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 14:04:58,029 INFO  L85        PathProgramCache]: Analyzing trace with hash -142433038, now seen corresponding path program 1 times
[2025-03-08 14:04:58,029 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 14:04:58,029 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257870907]
[2025-03-08 14:04:58,029 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 14:04:58,029 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 14:04:58,040 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes.
[2025-03-08 14:04:58,098 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements.
[2025-03-08 14:04:58,099 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 14:04:58,099 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 14:05:20,602 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked.
[2025-03-08 14:05:20,602 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 14:05:20,602 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257870907]
[2025-03-08 14:05:20,602 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257870907] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 14:05:20,602 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 14:05:20,602 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-08 14:05:20,602 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320572942]
[2025-03-08 14:05:20,603 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 14:05:20,603 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-08 14:05:20,603 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 14:05:20,603 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-08 14:05:20,603 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2025-03-08 14:05:20,603 INFO  L87              Difference]: Start difference. First operand 830 states and 1306 transitions. Second operand  has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 14:05:24,178 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 14:05:24,178 INFO  L93              Difference]: Finished difference Result 2329 states and 3626 transitions.
[2025-03-08 14:05:24,179 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 14:05:24,179 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 160
[2025-03-08 14:05:24,180 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 14:05:24,185 INFO  L225             Difference]: With dead ends: 2329
[2025-03-08 14:05:24,185 INFO  L226             Difference]: Without dead ends: 1502
[2025-03-08 14:05:24,186 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2025-03-08 14:05:24,188 INFO  L435           NwaCegarLoop]: 158 mSDtfsCounter, 410 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time
[2025-03-08 14:05:24,188 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 651 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time]
[2025-03-08 14:05:24,189 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1502 states.
[2025-03-08 14:05:24,217 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 835.
[2025-03-08 14:05:24,218 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 835 states, 721 states have (on average 1.5256588072122053) internal successors, (1100), 722 states have internal predecessors, (1100), 108 states have call successors, (108), 5 states have call predecessors, (108), 5 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108)
[2025-03-08 14:05:24,221 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1316 transitions.
[2025-03-08 14:05:24,222 INFO  L78                 Accepts]: Start accepts. Automaton has 835 states and 1316 transitions. Word has length 160
[2025-03-08 14:05:24,222 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 14:05:24,222 INFO  L471      AbstractCegarLoop]: Abstraction has 835 states and 1316 transitions.
[2025-03-08 14:05:24,222 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 14:05:24,222 INFO  L276                IsEmpty]: Start isEmpty. Operand 835 states and 1316 transitions.
[2025-03-08 14:05:24,224 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 161
[2025-03-08 14:05:24,224 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 14:05:24,224 INFO  L218           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:05:24,224 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-08 14:05:24,225 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 14:05:24,225 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 14:05:24,225 INFO  L85        PathProgramCache]: Analyzing trace with hash 2114477969, now seen corresponding path program 1 times
[2025-03-08 14:05:24,225 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 14:05:24,225 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607961751]
[2025-03-08 14:05:24,225 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 14:05:24,225 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 14:05:24,238 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes.
[2025-03-08 14:05:24,253 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements.
[2025-03-08 14:05:24,253 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 14:05:24,253 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 14:05:24,350 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked.
[2025-03-08 14:05:24,350 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 14:05:24,350 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607961751]
[2025-03-08 14:05:24,350 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607961751] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 14:05:24,350 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 14:05:24,350 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 14:05:24,351 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863999326]
[2025-03-08 14:05:24,351 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 14:05:24,351 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 14:05:24,351 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 14:05:24,351 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 14:05:24,351 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 14:05:24,352 INFO  L87              Difference]: Start difference. First operand 835 states and 1316 transitions. Second operand  has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 14:05:24,605 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 14:05:24,606 INFO  L93              Difference]: Finished difference Result 3479 states and 5486 transitions.
[2025-03-08 14:05:24,606 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 14:05:24,606 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 160
[2025-03-08 14:05:24,606 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 14:05:24,616 INFO  L225             Difference]: With dead ends: 3479
[2025-03-08 14:05:24,616 INFO  L226             Difference]: Without dead ends: 2647
[2025-03-08 14:05:24,619 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-08 14:05:24,620 INFO  L435           NwaCegarLoop]: 276 mSDtfsCounter, 464 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 14:05:24,620 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 889 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 14:05:24,622 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2647 states.
[2025-03-08 14:05:24,709 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2647 to 2366.
[2025-03-08 14:05:24,713 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2366 states, 2099 states have (on average 1.5331110052405907) internal successors, (3218), 2106 states have internal predecessors, (3218), 251 states have call successors, (251), 15 states have call predecessors, (251), 15 states have return successors, (251), 244 states have call predecessors, (251), 251 states have call successors, (251)
[2025-03-08 14:05:24,719 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2366 states and 3720 transitions.
[2025-03-08 14:05:24,720 INFO  L78                 Accepts]: Start accepts. Automaton has 2366 states and 3720 transitions. Word has length 160
[2025-03-08 14:05:24,721 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 14:05:24,721 INFO  L471      AbstractCegarLoop]: Abstraction has 2366 states and 3720 transitions.
[2025-03-08 14:05:24,721 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)
[2025-03-08 14:05:24,721 INFO  L276                IsEmpty]: Start isEmpty. Operand 2366 states and 3720 transitions.
[2025-03-08 14:05:24,723 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 162
[2025-03-08 14:05:24,723 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 14:05:24,724 INFO  L218           NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:05:24,724 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-08 14:05:24,724 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 14:05:24,724 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 14:05:24,724 INFO  L85        PathProgramCache]: Analyzing trace with hash -1065238425, now seen corresponding path program 1 times
[2025-03-08 14:05:24,724 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 14:05:24,724 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705417359]
[2025-03-08 14:05:24,724 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 14:05:24,724 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 14:05:24,733 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes.
[2025-03-08 14:05:24,768 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements.
[2025-03-08 14:05:24,768 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 14:05:24,768 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 14:05:51,397 INFO  L134       CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked.
[2025-03-08 14:05:51,397 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 14:05:51,397 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705417359]
[2025-03-08 14:05:51,397 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705417359] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 14:05:51,397 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 14:05:51,398 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-03-08 14:05:51,398 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344922984]
[2025-03-08 14:05:51,398 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 14:05:51,398 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-08 14:05:51,398 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 14:05:51,398 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-08 14:05:51,398 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2025-03-08 14:05:51,399 INFO  L87              Difference]: Start difference. First operand 2366 states and 3720 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)