./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-88.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_operatoramount_amount100_file-88.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 7a94438cde4f2b77ff462971d0eccab102016c89632333d771f07852ad7ba7f7
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 15:12:35,119 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 15:12:35,170 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-08 15:12:35,174 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 15:12:35,175 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 15:12:35,192 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 15:12:35,193 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 15:12:35,193 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 15:12:35,194 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 15:12:35,194 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 15:12:35,194 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 15:12:35,195 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 15:12:35,195 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 15:12:35,195 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 15:12:35,195 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 15:12:35,195 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 15:12:35,196 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 15:12:35,196 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-08 15:12:35,196 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-08 15:12:35,196 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-08 15:12:35,196 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 15:12:35,196 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 15:12:35,196 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 15:12:35,196 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 15:12:35,196 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-08 15:12:35,196 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 15:12:35,196 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 15:12:35,196 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 15:12:35,196 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 15:12:35,196 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 15:12:35,196 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 15:12:35,196 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 15:12:35,196 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 15:12:35,196 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 15:12:35,197 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 15:12:35,197 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 15:12:35,197 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 15:12:35,197 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-08 15:12:35,197 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-08 15:12:35,197 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 15:12:35,198 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 15:12:35,198 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 15:12:35,198 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 15:12:35,198 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 -> 7a94438cde4f2b77ff462971d0eccab102016c89632333d771f07852ad7ba7f7
[2025-03-08 15:12:35,511 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 15:12:35,522 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 15:12:35,525 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 15:12:35,526 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 15:12:35,526 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 15:12:35,527 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-88.i
[2025-03-08 15:12:37,367 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dde1c4c6f/483558b0c8d54d23876b98f41adfdd33/FLAG2d1ca6662
[2025-03-08 15:12:37,659 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 15:12:37,659 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-88.i
[2025-03-08 15:12:37,668 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dde1c4c6f/483558b0c8d54d23876b98f41adfdd33/FLAG2d1ca6662
[2025-03-08 15:12:37,685 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dde1c4c6f/483558b0c8d54d23876b98f41adfdd33
[2025-03-08 15:12:37,688 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 15:12:37,689 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 15:12:37,690 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 15:12:37,691 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 15:12:37,695 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 15:12:37,695 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:12:37" (1/1) ...
[2025-03-08 15:12:37,696 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69eed51d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:37, skipping insertion in model container
[2025-03-08 15:12:37,696 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:12:37" (1/1) ...
[2025-03-08 15:12:37,720 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 15:12:37,830 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_operatoramount_amount100_file-88.i[916,929]
[2025-03-08 15:12:37,887 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 15:12:37,896 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 15:12:37,905 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_operatoramount_amount100_file-88.i[916,929]
[2025-03-08 15:12:37,932 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 15:12:37,944 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 15:12:37,945 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:37 WrapperNode
[2025-03-08 15:12:37,945 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 15:12:37,946 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 15:12:37,946 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 15:12:37,946 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 15:12:37,951 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:37" (1/1) ...
[2025-03-08 15:12:37,959 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:37" (1/1) ...
[2025-03-08 15:12:37,986 INFO  L138                Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 278
[2025-03-08 15:12:37,986 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 15:12:37,987 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 15:12:37,987 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 15:12:37,988 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 15:12:37,994 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:37" (1/1) ...
[2025-03-08 15:12:37,994 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:37" (1/1) ...
[2025-03-08 15:12:37,998 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:37" (1/1) ...
[2025-03-08 15:12:38,018 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 15:12:38,019 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:37" (1/1) ...
[2025-03-08 15:12:38,019 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:37" (1/1) ...
[2025-03-08 15:12:38,028 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:37" (1/1) ...
[2025-03-08 15:12:38,031 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:37" (1/1) ...
[2025-03-08 15:12:38,034 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:37" (1/1) ...
[2025-03-08 15:12:38,035 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:37" (1/1) ...
[2025-03-08 15:12:38,040 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 15:12:38,041 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 15:12:38,041 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 15:12:38,041 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 15:12:38,042 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:37" (1/1) ...
[2025-03-08 15:12:38,046 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 15:12:38,057 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 15:12:38,070 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 15:12:38,075 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 15:12:38,096 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 15:12:38,096 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-08 15:12:38,096 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-08 15:12:38,096 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-08 15:12:38,096 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 15:12:38,096 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 15:12:38,163 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 15:12:38,165 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 15:12:38,548 INFO  L1307  $ProcedureCfgBuilder]: dead code at ProgramPoint L204: havoc property_#t~ite24#1;havoc property_#t~bitwise23#1;havoc property_#t~short25#1;havoc property_#t~ite27#1;havoc property_#t~bitwise26#1;havoc property_#t~short28#1;havoc property_#t~bitwise29#1;havoc property_#t~short30#1;
[2025-03-08 15:12:38,592 INFO  L?                        ?]: Removed 40 outVars from TransFormulas that were not future-live.
[2025-03-08 15:12:38,592 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 15:12:38,612 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 15:12:38,613 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 15:12:38,613 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:12:38 BoogieIcfgContainer
[2025-03-08 15:12:38,613 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 15:12:38,615 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 15:12:38,615 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 15:12:38,619 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 15:12:38,620 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:12:37" (1/3) ...
[2025-03-08 15:12:38,620 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c27f4a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:12:38, skipping insertion in model container
[2025-03-08 15:12:38,620 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:12:37" (2/3) ...
[2025-03-08 15:12:38,621 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c27f4a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:12:38, skipping insertion in model container
[2025-03-08 15:12:38,621 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:12:38" (3/3) ...
[2025-03-08 15:12:38,622 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-88.i
[2025-03-08 15:12:38,633 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 15:12:38,635 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-88.i that has 2 procedures, 116 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 15:12:38,685 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 15:12:38,695 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;@5ecaa3df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 15:12:38,697 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 15:12:38,700 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 116 states, 85 states have (on average 1.423529411764706) internal successors, (121), 86 states have internal predecessors, (121), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28)
[2025-03-08 15:12:38,713 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 192
[2025-03-08 15:12:38,713 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 15:12:38,714 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:12:38,714 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 15:12:38,719 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 15:12:38,719 INFO  L85        PathProgramCache]: Analyzing trace with hash -1050726038, now seen corresponding path program 1 times
[2025-03-08 15:12:38,725 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 15:12:38,726 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126507359]
[2025-03-08 15:12:38,728 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 15:12:38,729 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 15:12:38,822 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes.
[2025-03-08 15:12:38,853 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements.
[2025-03-08 15:12:38,855 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 15:12:38,857 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 15:12:39,093 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked.
[2025-03-08 15:12:39,094 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 15:12:39,094 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126507359]
[2025-03-08 15:12:39,095 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126507359] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 15:12:39,095 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31255364]
[2025-03-08 15:12:39,095 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 15:12:39,095 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 15:12:39,095 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 15:12:39,097 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 15:12:39,099 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 15:12:39,165 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes.
[2025-03-08 15:12:39,246 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements.
[2025-03-08 15:12:39,246 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 15:12:39,247 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 15:12:39,250 INFO  L256         TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-08 15:12:39,255 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 15:12:39,277 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked.
[2025-03-08 15:12:39,278 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 15:12:39,278 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [31255364] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 15:12:39,278 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 15:12:39,278 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-03-08 15:12:39,280 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560253085]
[2025-03-08 15:12:39,280 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 15:12:39,284 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-08 15:12:39,284 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 15:12:39,301 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-08 15:12:39,302 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 15:12:39,303 INFO  L87              Difference]: Start difference. First operand  has 116 states, 85 states have (on average 1.423529411764706) internal successors, (121), 86 states have internal predecessors, (121), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand  has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28)
[2025-03-08 15:12:39,339 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 15:12:39,339 INFO  L93              Difference]: Finished difference Result 226 states and 377 transitions.
[2025-03-08 15:12:39,340 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-08 15:12:39,341 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 191
[2025-03-08 15:12:39,341 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 15:12:39,346 INFO  L225             Difference]: With dead ends: 226
[2025-03-08 15:12:39,346 INFO  L226             Difference]: Without dead ends: 113
[2025-03-08 15:12:39,349 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 192 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 15:12:39,350 INFO  L435           NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 15:12:39,351 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 15:12:39,360 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 113 states.
[2025-03-08 15:12:39,379 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113.
[2025-03-08 15:12:39,380 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 113 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 83 states have internal predecessors, (116), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28)
[2025-03-08 15:12:39,384 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 172 transitions.
[2025-03-08 15:12:39,386 INFO  L78                 Accepts]: Start accepts. Automaton has 113 states and 172 transitions. Word has length 191
[2025-03-08 15:12:39,387 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 15:12:39,387 INFO  L471      AbstractCegarLoop]: Abstraction has 113 states and 172 transitions.
[2025-03-08 15:12:39,388 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28)
[2025-03-08 15:12:39,388 INFO  L276                IsEmpty]: Start isEmpty. Operand 113 states and 172 transitions.
[2025-03-08 15:12:39,390 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 192
[2025-03-08 15:12:39,390 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 15:12:39,390 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:12:39,400 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-03-08 15:12:39,591 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 15:12:39,591 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 15:12:39,592 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 15:12:39,592 INFO  L85        PathProgramCache]: Analyzing trace with hash 1947738662, now seen corresponding path program 1 times
[2025-03-08 15:12:39,592 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 15:12:39,592 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593817030]
[2025-03-08 15:12:39,593 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 15:12:39,593 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 15:12:39,608 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes.
[2025-03-08 15:12:39,680 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements.
[2025-03-08 15:12:39,682 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 15:12:39,682 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 15:12:40,283 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked.
[2025-03-08 15:12:40,283 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 15:12:40,283 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593817030]
[2025-03-08 15:12:40,283 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593817030] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 15:12:40,283 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 15:12:40,283 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 15:12:40,283 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300059388]
[2025-03-08 15:12:40,283 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 15:12:40,287 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 15:12:40,287 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 15:12:40,288 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 15:12:40,288 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 15:12:40,289 INFO  L87              Difference]: Start difference. First operand 113 states and 172 transitions. Second operand  has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-08 15:12:40,679 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 15:12:40,680 INFO  L93              Difference]: Finished difference Result 334 states and 511 transitions.
[2025-03-08 15:12:40,680 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 15:12:40,680 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 191
[2025-03-08 15:12:40,681 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 15:12:40,684 INFO  L225             Difference]: With dead ends: 334
[2025-03-08 15:12:40,684 INFO  L226             Difference]: Without dead ends: 224
[2025-03-08 15:12:40,685 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-08 15:12:40,687 INFO  L435           NwaCegarLoop]: 158 mSDtfsCounter, 117 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 15:12:40,687 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 524 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 15:12:40,688 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 224 states.
[2025-03-08 15:12:40,723 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 167.
[2025-03-08 15:12:40,724 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 167 states, 108 states have (on average 1.3240740740740742) internal successors, (143), 108 states have internal predecessors, (143), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56)
[2025-03-08 15:12:40,726 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 255 transitions.
[2025-03-08 15:12:40,728 INFO  L78                 Accepts]: Start accepts. Automaton has 167 states and 255 transitions. Word has length 191
[2025-03-08 15:12:40,728 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 15:12:40,728 INFO  L471      AbstractCegarLoop]: Abstraction has 167 states and 255 transitions.
[2025-03-08 15:12:40,729 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-08 15:12:40,729 INFO  L276                IsEmpty]: Start isEmpty. Operand 167 states and 255 transitions.
[2025-03-08 15:12:40,731 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 192
[2025-03-08 15:12:40,733 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 15:12:40,733 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:12:40,733 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-08 15:12:40,734 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 15:12:40,734 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 15:12:40,734 INFO  L85        PathProgramCache]: Analyzing trace with hash 1693002117, now seen corresponding path program 1 times
[2025-03-08 15:12:40,734 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 15:12:40,734 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61015272]
[2025-03-08 15:12:40,734 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 15:12:40,734 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 15:12:40,751 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes.
[2025-03-08 15:12:40,779 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements.
[2025-03-08 15:12:40,779 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 15:12:40,779 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 15:12:41,023 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked.
[2025-03-08 15:12:41,024 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 15:12:41,024 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61015272]
[2025-03-08 15:12:41,024 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61015272] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 15:12:41,024 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 15:12:41,024 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 15:12:41,024 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147599170]
[2025-03-08 15:12:41,024 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 15:12:41,024 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 15:12:41,025 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 15:12:41,025 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 15:12:41,025 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 15:12:41,026 INFO  L87              Difference]: Start difference. First operand 167 states and 255 transitions. Second operand  has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-08 15:12:41,197 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 15:12:41,198 INFO  L93              Difference]: Finished difference Result 427 states and 650 transitions.
[2025-03-08 15:12:41,198 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 15:12:41,198 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 191
[2025-03-08 15:12:41,199 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 15:12:41,200 INFO  L225             Difference]: With dead ends: 427
[2025-03-08 15:12:41,200 INFO  L226             Difference]: Without dead ends: 317
[2025-03-08 15:12:41,201 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-08 15:12:41,204 INFO  L435           NwaCegarLoop]: 158 mSDtfsCounter, 248 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 15:12:41,204 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 466 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 15:12:41,205 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 317 states.
[2025-03-08 15:12:41,241 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 271.
[2025-03-08 15:12:41,243 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 271 states, 183 states have (on average 1.3333333333333333) internal successors, (244), 183 states have internal predecessors, (244), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84)
[2025-03-08 15:12:41,246 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 412 transitions.
[2025-03-08 15:12:41,247 INFO  L78                 Accepts]: Start accepts. Automaton has 271 states and 412 transitions. Word has length 191
[2025-03-08 15:12:41,247 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 15:12:41,247 INFO  L471      AbstractCegarLoop]: Abstraction has 271 states and 412 transitions.
[2025-03-08 15:12:41,247 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-08 15:12:41,248 INFO  L276                IsEmpty]: Start isEmpty. Operand 271 states and 412 transitions.
[2025-03-08 15:12:41,249 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 193
[2025-03-08 15:12:41,251 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 15:12:41,252 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:12:41,252 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-08 15:12:41,252 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 15:12:41,252 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 15:12:41,252 INFO  L85        PathProgramCache]: Analyzing trace with hash 1959784189, now seen corresponding path program 1 times
[2025-03-08 15:12:41,252 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 15:12:41,253 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925929549]
[2025-03-08 15:12:41,253 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 15:12:41,253 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 15:12:41,265 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes.
[2025-03-08 15:12:41,308 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements.
[2025-03-08 15:12:41,308 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 15:12:41,308 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 15:12:42,082 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked.
[2025-03-08 15:12:42,083 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 15:12:42,083 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925929549]
[2025-03-08 15:12:42,084 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925929549] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 15:12:42,084 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 15:12:42,085 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 15:12:42,085 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203977965]
[2025-03-08 15:12:42,085 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 15:12:42,085 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 15:12:42,086 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 15:12:42,086 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 15:12:42,087 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-08 15:12:42,087 INFO  L87              Difference]: Start difference. First operand 271 states and 412 transitions. Second operand  has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-08 15:12:43,219 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 15:12:43,219 INFO  L93              Difference]: Finished difference Result 950 states and 1443 transitions.
[2025-03-08 15:12:43,220 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 15:12:43,220 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 192
[2025-03-08 15:12:43,221 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 15:12:43,229 INFO  L225             Difference]: With dead ends: 950
[2025-03-08 15:12:43,231 INFO  L226             Difference]: Without dead ends: 736
[2025-03-08 15:12:43,233 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-03-08 15:12:43,234 INFO  L435           NwaCegarLoop]: 245 mSDtfsCounter, 421 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-08 15:12:43,235 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 799 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-08 15:12:43,239 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 736 states.
[2025-03-08 15:12:43,320 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 395.
[2025-03-08 15:12:43,321 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 395 states, 278 states have (on average 1.3633093525179856) internal successors, (379), 278 states have internal predecessors, (379), 112 states have call successors, (112), 4 states have call predecessors, (112), 4 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112)
[2025-03-08 15:12:43,323 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 603 transitions.
[2025-03-08 15:12:43,324 INFO  L78                 Accepts]: Start accepts. Automaton has 395 states and 603 transitions. Word has length 192
[2025-03-08 15:12:43,325 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 15:12:43,325 INFO  L471      AbstractCegarLoop]: Abstraction has 395 states and 603 transitions.
[2025-03-08 15:12:43,325 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-08 15:12:43,325 INFO  L276                IsEmpty]: Start isEmpty. Operand 395 states and 603 transitions.
[2025-03-08 15:12:43,327 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 193
[2025-03-08 15:12:43,327 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 15:12:43,327 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:12:43,327 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-08 15:12:43,328 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 15:12:43,328 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 15:12:43,328 INFO  L85        PathProgramCache]: Analyzing trace with hash -827631298, now seen corresponding path program 1 times
[2025-03-08 15:12:43,328 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 15:12:43,328 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459352974]
[2025-03-08 15:12:43,328 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 15:12:43,329 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 15:12:43,342 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes.
[2025-03-08 15:12:43,389 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements.
[2025-03-08 15:12:43,389 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 15:12:43,389 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 15:12:43,675 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked.
[2025-03-08 15:12:43,676 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 15:12:43,676 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459352974]
[2025-03-08 15:12:43,676 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459352974] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 15:12:43,676 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 15:12:43,676 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 15:12:43,676 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534994666]
[2025-03-08 15:12:43,676 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 15:12:43,676 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 15:12:43,677 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 15:12:43,677 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 15:12:43,677 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-08 15:12:43,677 INFO  L87              Difference]: Start difference. First operand 395 states and 603 transitions. Second operand  has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-08 15:12:44,482 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 15:12:44,482 INFO  L93              Difference]: Finished difference Result 1288 states and 1966 transitions.
[2025-03-08 15:12:44,483 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 15:12:44,483 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 192
[2025-03-08 15:12:44,484 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 15:12:44,488 INFO  L225             Difference]: With dead ends: 1288
[2025-03-08 15:12:44,488 INFO  L226             Difference]: Without dead ends: 950
[2025-03-08 15:12:44,489 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2025-03-08 15:12:44,490 INFO  L435           NwaCegarLoop]: 210 mSDtfsCounter, 620 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 15:12:44,490 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 701 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 15:12:44,491 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 950 states.
[2025-03-08 15:12:44,583 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 529.
[2025-03-08 15:12:44,584 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 529 states, 383 states have (on average 1.3864229765013054) internal successors, (531), 383 states have internal predecessors, (531), 140 states have call successors, (140), 5 states have call predecessors, (140), 5 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140)
[2025-03-08 15:12:44,587 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 811 transitions.
[2025-03-08 15:12:44,588 INFO  L78                 Accepts]: Start accepts. Automaton has 529 states and 811 transitions. Word has length 192
[2025-03-08 15:12:44,588 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 15:12:44,588 INFO  L471      AbstractCegarLoop]: Abstraction has 529 states and 811 transitions.
[2025-03-08 15:12:44,589 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-08 15:12:44,589 INFO  L276                IsEmpty]: Start isEmpty. Operand 529 states and 811 transitions.
[2025-03-08 15:12:44,590 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 194
[2025-03-08 15:12:44,590 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 15:12:44,590 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:12:44,590 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-08 15:12:44,591 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 15:12:44,591 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 15:12:44,591 INFO  L85        PathProgramCache]: Analyzing trace with hash 1998079809, now seen corresponding path program 1 times
[2025-03-08 15:12:44,591 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 15:12:44,592 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604333824]
[2025-03-08 15:12:44,592 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 15:12:44,592 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 15:12:44,609 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes.
[2025-03-08 15:12:44,681 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements.
[2025-03-08 15:12:44,681 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 15:12:44,681 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 15:12:44,920 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked.
[2025-03-08 15:12:44,920 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 15:12:44,920 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604333824]
[2025-03-08 15:12:44,920 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604333824] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 15:12:44,920 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 15:12:44,920 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 15:12:44,920 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310042124]
[2025-03-08 15:12:44,921 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 15:12:44,921 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 15:12:44,921 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 15:12:44,922 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 15:12:44,922 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 15:12:44,922 INFO  L87              Difference]: Start difference. First operand 529 states and 811 transitions. Second operand  has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-08 15:12:45,558 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 15:12:45,558 INFO  L93              Difference]: Finished difference Result 1683 states and 2585 transitions.
[2025-03-08 15:12:45,559 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 15:12:45,559 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 193
[2025-03-08 15:12:45,559 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 15:12:45,566 INFO  L225             Difference]: With dead ends: 1683
[2025-03-08 15:12:45,567 INFO  L226             Difference]: Without dead ends: 1217
[2025-03-08 15:12:45,569 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2025-03-08 15:12:45,571 INFO  L435           NwaCegarLoop]: 174 mSDtfsCounter, 292 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 15:12:45,571 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 625 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 15:12:45,572 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1217 states.
[2025-03-08 15:12:45,741 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1213.
[2025-03-08 15:12:45,743 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1213 states, 893 states have (on average 1.3885778275475924) internal successors, (1240), 893 states have internal predecessors, (1240), 308 states have call successors, (308), 11 states have call predecessors, (308), 11 states have return successors, (308), 308 states have call predecessors, (308), 308 states have call successors, (308)
[2025-03-08 15:12:45,751 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1856 transitions.
[2025-03-08 15:12:45,753 INFO  L78                 Accepts]: Start accepts. Automaton has 1213 states and 1856 transitions. Word has length 193
[2025-03-08 15:12:45,753 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 15:12:45,753 INFO  L471      AbstractCegarLoop]: Abstraction has 1213 states and 1856 transitions.
[2025-03-08 15:12:45,753 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-08 15:12:45,754 INFO  L276                IsEmpty]: Start isEmpty. Operand 1213 states and 1856 transitions.
[2025-03-08 15:12:45,755 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 194
[2025-03-08 15:12:45,755 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 15:12:45,755 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:12:45,755 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-08 15:12:45,755 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 15:12:45,756 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 15:12:45,756 INFO  L85        PathProgramCache]: Analyzing trace with hash -258831198, now seen corresponding path program 1 times
[2025-03-08 15:12:45,756 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 15:12:45,756 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748353896]
[2025-03-08 15:12:45,756 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 15:12:45,756 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 15:12:45,768 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes.
[2025-03-08 15:12:45,803 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements.
[2025-03-08 15:12:45,804 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 15:12:45,804 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 15:12:45,933 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked.
[2025-03-08 15:12:45,933 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 15:12:45,933 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748353896]
[2025-03-08 15:12:45,933 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748353896] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 15:12:45,934 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 15:12:45,934 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 15:12:45,934 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101461322]
[2025-03-08 15:12:45,934 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 15:12:45,934 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 15:12:45,934 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 15:12:45,935 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 15:12:45,935 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 15:12:45,935 INFO  L87              Difference]: Start difference. First operand 1213 states and 1856 transitions. Second operand  has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-08 15:12:46,370 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 15:12:46,371 INFO  L93              Difference]: Finished difference Result 2134 states and 3272 transitions.
[2025-03-08 15:12:46,371 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 15:12:46,371 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 193
[2025-03-08 15:12:46,372 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 15:12:46,380 INFO  L225             Difference]: With dead ends: 2134
[2025-03-08 15:12:46,380 INFO  L226             Difference]: Without dead ends: 1668
[2025-03-08 15:12:46,382 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-08 15:12:46,382 INFO  L435           NwaCegarLoop]: 174 mSDtfsCounter, 166 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 15:12:46,382 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 406 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 15:12:46,384 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1668 states.
[2025-03-08 15:12:46,521 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 982.
[2025-03-08 15:12:46,523 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 982 states, 720 states have (on average 1.3819444444444444) internal successors, (995), 720 states have internal predecessors, (995), 252 states have call successors, (252), 9 states have call predecessors, (252), 9 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252)
[2025-03-08 15:12:46,528 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1499 transitions.
[2025-03-08 15:12:46,529 INFO  L78                 Accepts]: Start accepts. Automaton has 982 states and 1499 transitions. Word has length 193
[2025-03-08 15:12:46,530 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 15:12:46,530 INFO  L471      AbstractCegarLoop]: Abstraction has 982 states and 1499 transitions.
[2025-03-08 15:12:46,530 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-08 15:12:46,530 INFO  L276                IsEmpty]: Start isEmpty. Operand 982 states and 1499 transitions.
[2025-03-08 15:12:46,531 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 195
[2025-03-08 15:12:46,531 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 15:12:46,532 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:12:46,532 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-08 15:12:46,532 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 15:12:46,532 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 15:12:46,532 INFO  L85        PathProgramCache]: Analyzing trace with hash -686674823, now seen corresponding path program 1 times
[2025-03-08 15:12:46,532 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 15:12:46,533 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347999630]
[2025-03-08 15:12:46,533 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 15:12:46,533 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 15:12:46,551 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes.
[2025-03-08 15:12:46,567 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements.
[2025-03-08 15:12:46,568 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 15:12:46,568 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 15:12:46,639 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked.
[2025-03-08 15:12:46,639 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 15:12:46,639 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347999630]
[2025-03-08 15:12:46,639 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347999630] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 15:12:46,639 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 15:12:46,640 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 15:12:46,640 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70134681]
[2025-03-08 15:12:46,640 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 15:12:46,640 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 15:12:46,640 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 15:12:46,641 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 15:12:46,641 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 15:12:46,641 INFO  L87              Difference]: Start difference. First operand 982 states and 1499 transitions. Second operand  has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-08 15:12:46,808 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 15:12:46,809 INFO  L93              Difference]: Finished difference Result 1981 states and 3028 transitions.
[2025-03-08 15:12:46,811 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 15:12:46,811 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 194
[2025-03-08 15:12:46,812 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 15:12:46,818 INFO  L225             Difference]: With dead ends: 1981
[2025-03-08 15:12:46,818 INFO  L226             Difference]: Without dead ends: 1062
[2025-03-08 15:12:46,821 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 15:12:46,822 INFO  L435           NwaCegarLoop]: 155 mSDtfsCounter, 19 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 15:12:46,822 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 286 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 15:12:46,824 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1062 states.
[2025-03-08 15:12:46,948 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 982.
[2025-03-08 15:12:46,950 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 982 states, 720 states have (on average 1.3763888888888889) internal successors, (991), 720 states have internal predecessors, (991), 252 states have call successors, (252), 9 states have call predecessors, (252), 9 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252)
[2025-03-08 15:12:46,954 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1495 transitions.
[2025-03-08 15:12:46,956 INFO  L78                 Accepts]: Start accepts. Automaton has 982 states and 1495 transitions. Word has length 194
[2025-03-08 15:12:46,956 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 15:12:46,956 INFO  L471      AbstractCegarLoop]: Abstraction has 982 states and 1495 transitions.
[2025-03-08 15:12:46,957 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-08 15:12:46,957 INFO  L276                IsEmpty]: Start isEmpty. Operand 982 states and 1495 transitions.
[2025-03-08 15:12:46,960 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 196
[2025-03-08 15:12:46,960 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 15:12:46,960 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:12:46,960 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-08 15:12:46,961 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 15:12:46,962 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 15:12:46,962 INFO  L85        PathProgramCache]: Analyzing trace with hash -1492836060, now seen corresponding path program 1 times
[2025-03-08 15:12:46,963 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 15:12:46,963 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938350813]
[2025-03-08 15:12:46,963 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 15:12:46,963 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 15:12:46,979 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes.
[2025-03-08 15:12:47,009 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements.
[2025-03-08 15:12:47,010 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 15:12:47,010 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 15:12:48,052 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked.
[2025-03-08 15:12:48,052 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 15:12:48,052 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938350813]
[2025-03-08 15:12:48,052 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938350813] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 15:12:48,053 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 15:12:48,053 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-03-08 15:12:48,053 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398711896]
[2025-03-08 15:12:48,053 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 15:12:48,053 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-08 15:12:48,053 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 15:12:48,054 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-08 15:12:48,054 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2025-03-08 15:12:48,054 INFO  L87              Difference]: Start difference. First operand 982 states and 1495 transitions. Second operand  has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28)
[2025-03-08 15:12:49,712 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 15:12:49,713 INFO  L93              Difference]: Finished difference Result 2247 states and 3416 transitions.
[2025-03-08 15:12:49,713 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 15:12:49,714 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 195
[2025-03-08 15:12:49,714 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 15:12:49,721 INFO  L225             Difference]: With dead ends: 2247
[2025-03-08 15:12:49,721 INFO  L226             Difference]: Without dead ends: 1328
[2025-03-08 15:12:49,723 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156
[2025-03-08 15:12:49,724 INFO  L435           NwaCegarLoop]: 276 mSDtfsCounter, 489 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-03-08 15:12:49,724 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 1180 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-03-08 15:12:49,725 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1328 states.
[2025-03-08 15:12:49,820 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1218.
[2025-03-08 15:12:49,822 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1218 states, 898 states have (on average 1.3775055679287305) internal successors, (1237), 898 states have internal predecessors, (1237), 308 states have call successors, (308), 11 states have call predecessors, (308), 11 states have return successors, (308), 308 states have call predecessors, (308), 308 states have call successors, (308)
[2025-03-08 15:12:49,828 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1853 transitions.
[2025-03-08 15:12:49,830 INFO  L78                 Accepts]: Start accepts. Automaton has 1218 states and 1853 transitions. Word has length 195
[2025-03-08 15:12:49,830 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 15:12:49,832 INFO  L471      AbstractCegarLoop]: Abstraction has 1218 states and 1853 transitions.
[2025-03-08 15:12:49,832 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28)
[2025-03-08 15:12:49,832 INFO  L276                IsEmpty]: Start isEmpty. Operand 1218 states and 1853 transitions.
[2025-03-08 15:12:49,833 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 196
[2025-03-08 15:12:49,834 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 15:12:49,834 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:12:49,834 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-08 15:12:49,835 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 15:12:49,835 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 15:12:49,835 INFO  L85        PathProgramCache]: Analyzing trace with hash -1981256291, now seen corresponding path program 1 times
[2025-03-08 15:12:49,835 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 15:12:49,835 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44230220]
[2025-03-08 15:12:49,835 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 15:12:49,835 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 15:12:49,848 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes.
[2025-03-08 15:12:49,933 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements.
[2025-03-08 15:12:49,933 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 15:12:49,933 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 15:12:50,392 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 153 proven. 3 refuted. 0 times theorem prover too weak. 1356 trivial. 0 not checked.
[2025-03-08 15:12:50,392 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 15:12:50,392 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44230220]
[2025-03-08 15:12:50,392 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44230220] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 15:12:50,392 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661580956]
[2025-03-08 15:12:50,393 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 15:12:50,393 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 15:12:50,393 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 15:12:50,394 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-08 15:12:50,396 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-08 15:12:50,454 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes.
[2025-03-08 15:12:50,496 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements.
[2025-03-08 15:12:50,496 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 15:12:50,496 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 15:12:50,499 INFO  L256         TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-03-08 15:12:50,503 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 15:12:50,582 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked.
[2025-03-08 15:12:50,582 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 15:12:50,582 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [661580956] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 15:12:50,582 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 15:12:50,582 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10
[2025-03-08 15:12:50,582 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056487983]
[2025-03-08 15:12:50,582 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 15:12:50,583 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 15:12:50,583 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 15:12:50,583 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 15:12:50,583 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2025-03-08 15:12:50,583 INFO  L87              Difference]: Start difference. First operand 1218 states and 1853 transitions. Second operand  has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-08 15:12:51,077 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 15:12:51,077 INFO  L93              Difference]: Finished difference Result 2881 states and 4389 transitions.
[2025-03-08 15:12:51,078 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 15:12:51,078 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 195
[2025-03-08 15:12:51,078 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 15:12:51,087 INFO  L225             Difference]: With dead ends: 2881
[2025-03-08 15:12:51,088 INFO  L226             Difference]: Without dead ends: 1958
[2025-03-08 15:12:51,091 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132
[2025-03-08 15:12:51,091 INFO  L435           NwaCegarLoop]: 279 mSDtfsCounter, 278 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 15:12:51,092 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 940 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 15:12:51,093 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1958 states.
[2025-03-08 15:12:51,259 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1958 to 1675.
[2025-03-08 15:12:51,261 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1675 states, 1239 states have (on average 1.3631961259079903) internal successors, (1689), 1239 states have internal predecessors, (1689), 420 states have call successors, (420), 15 states have call predecessors, (420), 15 states have return successors, (420), 420 states have call predecessors, (420), 420 states have call successors, (420)
[2025-03-08 15:12:51,268 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1675 states and 2529 transitions.
[2025-03-08 15:12:51,270 INFO  L78                 Accepts]: Start accepts. Automaton has 1675 states and 2529 transitions. Word has length 195
[2025-03-08 15:12:51,270 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 15:12:51,270 INFO  L471      AbstractCegarLoop]: Abstraction has 1675 states and 2529 transitions.
[2025-03-08 15:12:51,270 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-08 15:12:51,271 INFO  L276                IsEmpty]: Start isEmpty. Operand 1675 states and 2529 transitions.
[2025-03-08 15:12:51,272 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 196
[2025-03-08 15:12:51,273 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 15:12:51,273 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:12:51,281 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-03-08 15:12:51,475 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2025-03-08 15:12:51,475 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 15:12:51,475 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 15:12:51,475 INFO  L85        PathProgramCache]: Analyzing trace with hash -1425829307, now seen corresponding path program 1 times
[2025-03-08 15:12:51,475 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 15:12:51,475 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001128479]
[2025-03-08 15:12:51,475 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 15:12:51,476 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 15:12:51,488 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes.
[2025-03-08 15:12:51,526 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements.
[2025-03-08 15:12:51,527 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 15:12:51,527 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 15:12:52,011 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked.
[2025-03-08 15:12:52,013 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 15:12:52,013 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001128479]
[2025-03-08 15:12:52,013 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001128479] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 15:12:52,013 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 15:12:52,013 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-08 15:12:52,013 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56956091]
[2025-03-08 15:12:52,014 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 15:12:52,014 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-08 15:12:52,015 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 15:12:52,016 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-08 15:12:52,016 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-03-08 15:12:52,016 INFO  L87              Difference]: Start difference. First operand 1675 states and 2529 transitions. Second operand  has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-08 15:12:53,176 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 15:12:53,176 INFO  L93              Difference]: Finished difference Result 3294 states and 4971 transitions.
[2025-03-08 15:12:53,177 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 15:12:53,177 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 195
[2025-03-08 15:12:53,179 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 15:12:53,189 INFO  L225             Difference]: With dead ends: 3294
[2025-03-08 15:12:53,189 INFO  L226             Difference]: Without dead ends: 1918
[2025-03-08 15:12:53,194 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132
[2025-03-08 15:12:53,195 INFO  L435           NwaCegarLoop]: 239 mSDtfsCounter, 407 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-08 15:12:53,195 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 791 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-08 15:12:53,197 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1918 states.
[2025-03-08 15:12:53,346 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1918 to 1440.
[2025-03-08 15:12:53,349 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1440 states, 1062 states have (on average 1.35969868173258) internal successors, (1444), 1062 states have internal predecessors, (1444), 364 states have call successors, (364), 13 states have call predecessors, (364), 13 states have return successors, (364), 364 states have call predecessors, (364), 364 states have call successors, (364)
[2025-03-08 15:12:53,353 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 2172 transitions.
[2025-03-08 15:12:53,355 INFO  L78                 Accepts]: Start accepts. Automaton has 1440 states and 2172 transitions. Word has length 195
[2025-03-08 15:12:53,356 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 15:12:53,356 INFO  L471      AbstractCegarLoop]: Abstraction has 1440 states and 2172 transitions.
[2025-03-08 15:12:53,356 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-08 15:12:53,356 INFO  L276                IsEmpty]: Start isEmpty. Operand 1440 states and 2172 transitions.
[2025-03-08 15:12:53,358 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 197
[2025-03-08 15:12:53,358 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 15:12:53,358 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:12:53,359 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-08 15:12:53,359 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 15:12:53,359 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 15:12:53,359 INFO  L85        PathProgramCache]: Analyzing trace with hash -601913732, now seen corresponding path program 1 times
[2025-03-08 15:12:53,359 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 15:12:53,359 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45737007]
[2025-03-08 15:12:53,359 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 15:12:53,359 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 15:12:53,371 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes.
[2025-03-08 15:12:53,381 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements.
[2025-03-08 15:12:53,382 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 15:12:53,382 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 15:12:53,489 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked.
[2025-03-08 15:12:53,489 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 15:12:53,489 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45737007]
[2025-03-08 15:12:53,489 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45737007] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 15:12:53,489 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 15:12:53,489 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 15:12:53,489 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591707696]
[2025-03-08 15:12:53,490 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 15:12:53,490 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 15:12:53,491 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 15:12:53,491 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 15:12:53,491 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 15:12:53,491 INFO  L87              Difference]: Start difference. First operand 1440 states and 2172 transitions. Second operand  has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-08 15:12:54,006 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 15:12:54,007 INFO  L93              Difference]: Finished difference Result 4386 states and 6631 transitions.
[2025-03-08 15:12:54,007 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 15:12:54,008 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 196
[2025-03-08 15:12:54,008 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 15:12:54,021 INFO  L225             Difference]: With dead ends: 4386
[2025-03-08 15:12:54,022 INFO  L226             Difference]: Without dead ends: 3009
[2025-03-08 15:12:54,026 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 15:12:54,027 INFO  L435           NwaCegarLoop]: 216 mSDtfsCounter, 234 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 15:12:54,027 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 441 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 15:12:54,030 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3009 states.
[2025-03-08 15:12:54,260 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3009 to 2450.
[2025-03-08 15:12:54,264 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2450 states, 1840 states have (on average 1.3668478260869565) internal successors, (2515), 1840 states have internal predecessors, (2515), 588 states have call successors, (588), 21 states have call predecessors, (588), 21 states have return successors, (588), 588 states have call predecessors, (588), 588 states have call successors, (588)
[2025-03-08 15:12:54,272 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 3691 transitions.
[2025-03-08 15:12:54,275 INFO  L78                 Accepts]: Start accepts. Automaton has 2450 states and 3691 transitions. Word has length 196
[2025-03-08 15:12:54,275 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 15:12:54,275 INFO  L471      AbstractCegarLoop]: Abstraction has 2450 states and 3691 transitions.
[2025-03-08 15:12:54,275 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-08 15:12:54,276 INFO  L276                IsEmpty]: Start isEmpty. Operand 2450 states and 3691 transitions.
[2025-03-08 15:12:54,278 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 197
[2025-03-08 15:12:54,278 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 15:12:54,279 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:12:54,279 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-08 15:12:54,279 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 15:12:54,279 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 15:12:54,279 INFO  L85        PathProgramCache]: Analyzing trace with hash -1983515743, now seen corresponding path program 1 times
[2025-03-08 15:12:54,279 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 15:12:54,279 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970587085]
[2025-03-08 15:12:54,280 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 15:12:54,280 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 15:12:54,290 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes.
[2025-03-08 15:12:54,348 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements.
[2025-03-08 15:12:54,348 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 15:12:54,348 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 15:12:54,787 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 153 proven. 3 refuted. 0 times theorem prover too weak. 1356 trivial. 0 not checked.
[2025-03-08 15:12:54,787 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 15:12:54,787 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970587085]
[2025-03-08 15:12:54,787 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970587085] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 15:12:54,787 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411668107]
[2025-03-08 15:12:54,787 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 15:12:54,788 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 15:12:54,788 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 15:12:54,790 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 15:12:54,792 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-03-08 15:12:54,858 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes.
[2025-03-08 15:12:54,907 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements.
[2025-03-08 15:12:54,907 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 15:12:54,907 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 15:12:54,912 INFO  L256         TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 13 conjuncts are in the unsatisfiable core
[2025-03-08 15:12:54,916 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 15:12:55,074 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 283 proven. 3 refuted. 0 times theorem prover too weak. 1226 trivial. 0 not checked.
[2025-03-08 15:12:55,074 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 15:12:55,420 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 153 proven. 6 refuted. 0 times theorem prover too weak. 1353 trivial. 0 not checked.
[2025-03-08 15:12:55,420 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [411668107] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-08 15:12:55,421 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-08 15:12:55,421 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15
[2025-03-08 15:12:55,421 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989429198]
[2025-03-08 15:12:55,421 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-08 15:12:55,421 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2025-03-08 15:12:55,421 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 15:12:55,422 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2025-03-08 15:12:55,422 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210
[2025-03-08 15:12:55,422 INFO  L87              Difference]: Start difference. First operand 2450 states and 3691 transitions. Second operand  has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 2 states have call successors, (30), 2 states have call predecessors, (30), 6 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32)
[2025-03-08 15:12:56,005 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 15:12:56,006 INFO  L93              Difference]: Finished difference Result 3876 states and 5728 transitions.
[2025-03-08 15:12:56,006 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-03-08 15:12:56,007 INFO  L78                 Accepts]: Start accepts. Automaton has  has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 2 states have call successors, (30), 2 states have call predecessors, (30), 6 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) Word has length 196
[2025-03-08 15:12:56,007 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 15:12:56,016 INFO  L225             Difference]: With dead ends: 3876
[2025-03-08 15:12:56,016 INFO  L226             Difference]: Without dead ends: 1489
[2025-03-08 15:12:56,022 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 387 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=242, Invalid=514, Unknown=0, NotChecked=0, Total=756
[2025-03-08 15:12:56,024 INFO  L435           NwaCegarLoop]: 124 mSDtfsCounter, 689 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 15:12:56,025 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 314 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 15:12:56,026 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1489 states.
[2025-03-08 15:12:56,220 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 1403.
[2025-03-08 15:12:56,223 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1403 states, 1061 states have (on average 1.3374175306314797) internal successors, (1419), 1061 states have internal predecessors, (1419), 308 states have call successors, (308), 33 states have call predecessors, (308), 33 states have return successors, (308), 308 states have call predecessors, (308), 308 states have call successors, (308)
[2025-03-08 15:12:56,227 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1403 states to 1403 states and 2035 transitions.
[2025-03-08 15:12:56,229 INFO  L78                 Accepts]: Start accepts. Automaton has 1403 states and 2035 transitions. Word has length 196
[2025-03-08 15:12:56,229 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 15:12:56,229 INFO  L471      AbstractCegarLoop]: Abstraction has 1403 states and 2035 transitions.
[2025-03-08 15:12:56,229 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 2 states have call successors, (30), 2 states have call predecessors, (30), 6 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32)
[2025-03-08 15:12:56,229 INFO  L276                IsEmpty]: Start isEmpty. Operand 1403 states and 2035 transitions.
[2025-03-08 15:12:56,232 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 197
[2025-03-08 15:12:56,232 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 15:12:56,232 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:12:56,240 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-03-08 15:12:56,433 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 15:12:56,433 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 15:12:56,433 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 15:12:56,433 INFO  L85        PathProgramCache]: Analyzing trace with hash 1475295611, now seen corresponding path program 1 times
[2025-03-08 15:12:56,434 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 15:12:56,434 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080465229]
[2025-03-08 15:12:56,434 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 15:12:56,434 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 15:12:56,446 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes.
[2025-03-08 15:12:56,478 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements.
[2025-03-08 15:12:56,478 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 15:12:56,478 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 15:12:56,629 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked.
[2025-03-08 15:12:56,629 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 15:12:56,629 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080465229]
[2025-03-08 15:12:56,629 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080465229] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 15:12:56,629 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 15:12:56,629 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 15:12:56,630 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328653238]
[2025-03-08 15:12:56,630 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 15:12:56,630 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 15:12:56,630 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 15:12:56,630 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 15:12:56,631 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 15:12:56,631 INFO  L87              Difference]: Start difference. First operand 1403 states and 2035 transitions. Second operand  has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-08 15:12:57,534 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 15:12:57,534 INFO  L93              Difference]: Finished difference Result 4171 states and 6050 transitions.
[2025-03-08 15:12:57,535 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 15:12:57,535 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 196
[2025-03-08 15:12:57,535 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 15:12:57,548 INFO  L225             Difference]: With dead ends: 4171
[2025-03-08 15:12:57,548 INFO  L226             Difference]: Without dead ends: 2839
[2025-03-08 15:12:57,552 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-08 15:12:57,552 INFO  L435           NwaCegarLoop]: 334 mSDtfsCounter, 280 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 15:12:57,552 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 825 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 15:12:57,555 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2839 states.
[2025-03-08 15:12:57,881 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2839 to 2020.
[2025-03-08 15:12:57,884 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2020 states, 1554 states have (on average 1.341055341055341) internal successors, (2084), 1554 states have internal predecessors, (2084), 420 states have call successors, (420), 45 states have call predecessors, (420), 45 states have return successors, (420), 420 states have call predecessors, (420), 420 states have call successors, (420)
[2025-03-08 15:12:57,890 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 2924 transitions.
[2025-03-08 15:12:57,896 INFO  L78                 Accepts]: Start accepts. Automaton has 2020 states and 2924 transitions. Word has length 196
[2025-03-08 15:12:57,896 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 15:12:57,896 INFO  L471      AbstractCegarLoop]: Abstraction has 2020 states and 2924 transitions.
[2025-03-08 15:12:57,897 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-08 15:12:57,897 INFO  L276                IsEmpty]: Start isEmpty. Operand 2020 states and 2924 transitions.
[2025-03-08 15:12:57,899 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 197
[2025-03-08 15:12:57,902 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 15:12:57,903 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:12:57,903 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-08 15:12:57,903 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 15:12:57,903 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 15:12:57,903 INFO  L85        PathProgramCache]: Analyzing trace with hash -1431760170, now seen corresponding path program 1 times
[2025-03-08 15:12:57,903 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 15:12:57,903 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118207062]
[2025-03-08 15:12:57,903 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 15:12:57,904 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 15:12:57,920 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes.
[2025-03-08 15:12:57,947 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements.
[2025-03-08 15:12:57,948 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 15:12:57,948 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 15:12:58,749 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 6 proven. 75 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked.
[2025-03-08 15:12:58,749 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 15:12:58,749 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118207062]
[2025-03-08 15:12:58,749 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118207062] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 15:12:58,749 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364788571]
[2025-03-08 15:12:58,749 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 15:12:58,749 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 15:12:58,749 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 15:12:58,752 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 15:12:58,753 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-03-08 15:12:58,827 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes.
[2025-03-08 15:12:58,870 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements.
[2025-03-08 15:12:58,871 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 15:12:58,871 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 15:12:58,873 INFO  L256         TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 21 conjuncts are in the unsatisfiable core
[2025-03-08 15:12:58,877 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 15:12:59,765 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked.
[2025-03-08 15:12:59,765 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 15:12:59,765 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364788571] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 15:12:59,765 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 15:12:59,765 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 20
[2025-03-08 15:12:59,765 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139415158]
[2025-03-08 15:12:59,765 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 15:12:59,767 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-03-08 15:12:59,767 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 15:12:59,768 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-03-08 15:12:59,768 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380
[2025-03-08 15:12:59,768 INFO  L87              Difference]: Start difference. First operand 2020 states and 2924 transitions. Second operand  has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-08 15:13:00,463 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 15:13:00,464 INFO  L93              Difference]: Finished difference Result 3365 states and 4853 transitions.
[2025-03-08 15:13:00,465 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-03-08 15:13:00,465 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 196
[2025-03-08 15:13:00,465 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 15:13:00,477 INFO  L225             Difference]: With dead ends: 3365
[2025-03-08 15:13:00,477 INFO  L226             Difference]: Without dead ends: 2274
[2025-03-08 15:13:00,482 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462
[2025-03-08 15:13:00,483 INFO  L435           NwaCegarLoop]: 145 mSDtfsCounter, 235 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 15:13:00,483 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 913 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 15:13:00,485 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2274 states.
[2025-03-08 15:13:00,797 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2274 to 2076.
[2025-03-08 15:13:00,800 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2076 states, 1610 states have (on average 1.3422360248447205) internal successors, (2161), 1610 states have internal predecessors, (2161), 420 states have call successors, (420), 45 states have call predecessors, (420), 45 states have return successors, (420), 420 states have call predecessors, (420), 420 states have call successors, (420)
[2025-03-08 15:13:00,804 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2076 states to 2076 states and 3001 transitions.
[2025-03-08 15:13:00,806 INFO  L78                 Accepts]: Start accepts. Automaton has 2076 states and 3001 transitions. Word has length 196
[2025-03-08 15:13:00,807 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 15:13:00,807 INFO  L471      AbstractCegarLoop]: Abstraction has 2076 states and 3001 transitions.
[2025-03-08 15:13:00,807 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-08 15:13:00,807 INFO  L276                IsEmpty]: Start isEmpty. Operand 2076 states and 3001 transitions.
[2025-03-08 15:13:00,808 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 198
[2025-03-08 15:13:00,808 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 15:13:00,809 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:13:00,816 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-03-08 15:13:01,012 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14
[2025-03-08 15:13:01,013 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 15:13:01,013 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 15:13:01,013 INFO  L85        PathProgramCache]: Analyzing trace with hash -25389562, now seen corresponding path program 1 times
[2025-03-08 15:13:01,013 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 15:13:01,013 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317695462]
[2025-03-08 15:13:01,013 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 15:13:01,013 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 15:13:01,025 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes.
[2025-03-08 15:13:01,047 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements.
[2025-03-08 15:13:01,047 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 15:13:01,047 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 15:13:01,171 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked.
[2025-03-08 15:13:01,172 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 15:13:01,172 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317695462]
[2025-03-08 15:13:01,172 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317695462] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 15:13:01,172 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 15:13:01,172 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 15:13:01,172 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637323816]
[2025-03-08 15:13:01,172 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 15:13:01,172 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 15:13:01,173 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 15:13:01,173 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 15:13:01,173 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 15:13:01,174 INFO  L87              Difference]: Start difference. First operand 2076 states and 3001 transitions. Second operand  has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-08 15:13:01,683 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 15:13:01,683 INFO  L93              Difference]: Finished difference Result 3726 states and 5390 transitions.
[2025-03-08 15:13:01,683 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 15:13:01,684 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 197
[2025-03-08 15:13:01,684 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 15:13:01,691 INFO  L225             Difference]: With dead ends: 3726
[2025-03-08 15:13:01,691 INFO  L226             Difference]: Without dead ends: 1918
[2025-03-08 15:13:01,694 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-03-08 15:13:01,695 INFO  L435           NwaCegarLoop]: 165 mSDtfsCounter, 167 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 15:13:01,695 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 377 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 15:13:01,697 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1918 states.
[2025-03-08 15:13:01,960 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1918 to 1916.
[2025-03-08 15:13:01,967 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1916 states, 1481 states have (on average 1.3403106009453072) internal successors, (1985), 1481 states have internal predecessors, (1985), 392 states have call successors, (392), 42 states have call predecessors, (392), 42 states have return successors, (392), 392 states have call predecessors, (392), 392 states have call successors, (392)
[2025-03-08 15:13:01,972 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1916 states and 2769 transitions.
[2025-03-08 15:13:01,975 INFO  L78                 Accepts]: Start accepts. Automaton has 1916 states and 2769 transitions. Word has length 197
[2025-03-08 15:13:01,975 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 15:13:01,975 INFO  L471      AbstractCegarLoop]: Abstraction has 1916 states and 2769 transitions.
[2025-03-08 15:13:01,976 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-08 15:13:01,976 INFO  L276                IsEmpty]: Start isEmpty. Operand 1916 states and 2769 transitions.
[2025-03-08 15:13:01,977 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 198
[2025-03-08 15:13:01,977 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 15:13:01,977 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:13:01,978 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-08 15:13:01,978 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 15:13:01,978 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 15:13:01,978 INFO  L85        PathProgramCache]: Analyzing trace with hash -56409369, now seen corresponding path program 1 times
[2025-03-08 15:13:01,978 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 15:13:01,978 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849456341]
[2025-03-08 15:13:01,978 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 15:13:01,979 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 15:13:01,991 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes.
[2025-03-08 15:13:02,018 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements.
[2025-03-08 15:13:02,018 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 15:13:02,018 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 15:13:02,528 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked.
[2025-03-08 15:13:02,528 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 15:13:02,528 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849456341]
[2025-03-08 15:13:02,528 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849456341] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 15:13:02,528 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 15:13:02,528 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 15:13:02,528 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922864389]
[2025-03-08 15:13:02,528 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 15:13:02,529 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 15:13:02,529 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 15:13:02,530 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 15:13:02,530 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-03-08 15:13:02,530 INFO  L87              Difference]: Start difference. First operand 1916 states and 2769 transitions. Second operand  has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-08 15:13:03,452 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 15:13:03,452 INFO  L93              Difference]: Finished difference Result 3907 states and 5631 transitions.
[2025-03-08 15:13:03,453 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 15:13:03,454 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 197
[2025-03-08 15:13:03,454 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 15:13:03,464 INFO  L225             Difference]: With dead ends: 3907
[2025-03-08 15:13:03,465 INFO  L226             Difference]: Without dead ends: 2266
[2025-03-08 15:13:03,467 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2025-03-08 15:13:03,468 INFO  L435           NwaCegarLoop]: 223 mSDtfsCounter, 285 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 15:13:03,468 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 600 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 15:13:03,469 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2266 states.
[2025-03-08 15:13:03,709 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2266 to 1923.
[2025-03-08 15:13:03,711 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1923 states, 1488 states have (on average 1.3366935483870968) internal successors, (1989), 1488 states have internal predecessors, (1989), 392 states have call successors, (392), 42 states have call predecessors, (392), 42 states have return successors, (392), 392 states have call predecessors, (392), 392 states have call successors, (392)
[2025-03-08 15:13:03,716 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1923 states to 1923 states and 2773 transitions.
[2025-03-08 15:13:03,720 INFO  L78                 Accepts]: Start accepts. Automaton has 1923 states and 2773 transitions. Word has length 197
[2025-03-08 15:13:03,720 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 15:13:03,720 INFO  L471      AbstractCegarLoop]: Abstraction has 1923 states and 2773 transitions.
[2025-03-08 15:13:03,720 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-08 15:13:03,721 INFO  L276                IsEmpty]: Start isEmpty. Operand 1923 states and 2773 transitions.
[2025-03-08 15:13:03,722 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 199
[2025-03-08 15:13:03,722 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 15:13:03,722 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:13:03,722 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-08 15:13:03,722 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 15:13:03,722 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 15:13:03,723 INFO  L85        PathProgramCache]: Analyzing trace with hash -1807735149, now seen corresponding path program 1 times
[2025-03-08 15:13:03,723 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 15:13:03,723 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848671954]
[2025-03-08 15:13:03,723 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 15:13:03,723 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 15:13:03,736 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes.
[2025-03-08 15:13:03,798 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements.
[2025-03-08 15:13:03,799 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 15:13:03,799 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2025-03-08 15:13:03,802 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [288597240]
[2025-03-08 15:13:03,802 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 15:13:03,802 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 15:13:03,802 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 15:13:03,804 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 15:13:03,806 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-03-08 15:13:03,880 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes.
[2025-03-08 15:13:04,334 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements.
[2025-03-08 15:13:04,335 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 15:13:04,335 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 15:13:04,337 INFO  L256         TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 33 conjuncts are in the unsatisfiable core
[2025-03-08 15:13:04,341 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 15:13:05,885 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 947 proven. 180 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked.
[2025-03-08 15:13:05,886 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 15:13:24,231 WARN  L286               SmtUtils]: Spent 12.42s on a formula simplification. DAG size of input: 28 DAG size of output: 24 (called from [L 188] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionTir.tryToEliminateOne)
[2025-03-08 15:13:38,062 WARN  L286               SmtUtils]: Spent 13.42s on a formula simplification. DAG size of input: 30 DAG size of output: 26 (called from [L 188] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionTir.tryToEliminateOne)
[2025-03-08 15:13:47,800 WARN  L873   $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~var_1_27~0 65536)) (.cse12 (mod (* c_~var_1_27~0 3) 65536))) (let ((.cse3 (mod c_~var_1_20~0 256)) (.cse4 (* 4294967295 c_~var_1_18~0)) (.cse17 (* c_~var_1_27~0 .cse12)) (.cse15 (* 4294901760 c_~var_1_27~0)) (.cse18 (* .cse2 c_~var_1_27~0)) (.cse16 (* c_~var_1_27~0 4294967295 (mod c_~var_1_21~0 256)))) (let ((.cse5 (< 32767 .cse2)) (.cse1 (mod (+ .cse18 .cse16) 4294967296)) (.cse6 (< .cse2 32768)) (.cse7 (mod (+ .cse15 .cse18 .cse16) 4294967296)) (.cse0 (< 0 c_~var_1_27~0)) (.cse9 (< c_~var_1_27~0 1)) (.cse13 (< 32767 .cse12)) (.cse14 (mod (+ .cse16 .cse17) 4294967296)) (.cse10 (< .cse12 32768)) (.cse11 (mod (+ .cse15 .cse16 .cse17) 4294967296)) (.cse8 (mod (+ .cse3 .cse4 25) 4294967296))) (and (or .cse0 (and (or (< .cse1 (+ (mod (+ .cse2 .cse3 .cse4 25) 4294967296) 1)) .cse5) (or .cse6 (< .cse7 (+ (mod (+ .cse2 4294901785 .cse3 .cse4) 4294967296) 1))))) (or (and (or .cse5 (< .cse1 (+ .cse2 .cse8 1))) (or .cse6 (< .cse7 (+ .cse2 4294901761 .cse8)))) .cse0) (or .cse9 (and (or .cse10 (< .cse11 (+ (mod (+ 4294901785 .cse3 .cse4 .cse12) 4294967296) 1))) (or .cse13 (< .cse14 (+ (mod (+ .cse3 .cse4 25 .cse12) 4294967296) 1))))) (or .cse9 (and (or .cse13 (< .cse14 (+ .cse8 .cse12 1))) (or .cse10 (< .cse11 (+ 4294901761 .cse8 .cse12))))))))) is different from true