./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label36.c --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version 4a390ef5
Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label36.c -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 8cfcc97b5952aa72da47fe0e4e97f4617137d46f4db9024e30e3a5a5c97f7e95
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-4a390ef-m
[2024-10-23 21:07:23,810 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-10-23 21:07:23,866 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-10-23 21:07:23,870 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-10-23 21:07:23,870 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-10-23 21:07:23,891 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-10-23 21:07:23,892 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-10-23 21:07:23,892 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-10-23 21:07:23,893 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-10-23 21:07:23,894 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-10-23 21:07:23,894 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-10-23 21:07:23,895 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-10-23 21:07:23,895 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-10-23 21:07:23,895 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-10-23 21:07:23,896 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-10-23 21:07:23,898 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-10-23 21:07:23,898 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-10-23 21:07:23,898 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-10-23 21:07:23,899 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-10-23 21:07:23,899 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-10-23 21:07:23,899 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-10-23 21:07:23,899 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-10-23 21:07:23,899 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-10-23 21:07:23,900 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-10-23 21:07:23,900 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-10-23 21:07:23,900 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-10-23 21:07:23,900 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-10-23 21:07:23,900 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-10-23 21:07:23,900 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-10-23 21:07:23,900 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-10-23 21:07:23,901 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-10-23 21:07:23,901 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-10-23 21:07:23,901 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-23 21:07:23,901 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-10-23 21:07:23,901 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-10-23 21:07:23,901 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-10-23 21:07:23,902 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-10-23 21:07:23,902 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-10-23 21:07:23,902 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-10-23 21:07:23,902 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-10-23 21:07:23,902 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-10-23 21:07:23,904 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-10-23 21:07:23,904 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
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 -> 8cfcc97b5952aa72da47fe0e4e97f4617137d46f4db9024e30e3a5a5c97f7e95
[2024-10-23 21:07:24,101 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-10-23 21:07:24,122 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-10-23 21:07:24,124 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-10-23 21:07:24,125 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-10-23 21:07:24,125 INFO  L274        PluginConnector]: CDTParser initialized
[2024-10-23 21:07:24,126 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label36.c
[2024-10-23 21:07:25,326 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-10-23 21:07:25,639 INFO  L384              CDTParser]: Found 1 translation units.
[2024-10-23 21:07:25,640 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label36.c
[2024-10-23 21:07:25,668 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b270e8c21/7c3e751e185142508397c28b27fbc557/FLAGb83466166
[2024-10-23 21:07:25,877 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b270e8c21/7c3e751e185142508397c28b27fbc557
[2024-10-23 21:07:25,879 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-10-23 21:07:25,880 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-10-23 21:07:25,882 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-10-23 21:07:25,882 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-10-23 21:07:25,887 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-10-23 21:07:25,888 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:07:25" (1/1) ...
[2024-10-23 21:07:25,890 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6851b674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:07:25, skipping insertion in model container
[2024-10-23 21:07:25,890 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:07:25" (1/1) ...
[2024-10-23 21:07:26,001 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-10-23 21:07:26,167 WARN  L248   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label36.c[7066,7079]
[2024-10-23 21:07:26,675 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-10-23 21:07:26,685 INFO  L200         MainTranslator]: Completed pre-run
[2024-10-23 21:07:26,705 WARN  L248   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label36.c[7066,7079]
[2024-10-23 21:07:26,976 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-10-23 21:07:26,996 INFO  L204         MainTranslator]: Completed translation
[2024-10-23 21:07:26,997 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:07:26 WrapperNode
[2024-10-23 21:07:26,997 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-10-23 21:07:26,998 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-10-23 21:07:26,998 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-10-23 21:07:26,998 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-10-23 21:07:27,003 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:07:26" (1/1) ...
[2024-10-23 21:07:27,035 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:07:26" (1/1) ...
[2024-10-23 21:07:27,226 INFO  L138                Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4761
[2024-10-23 21:07:27,227 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-10-23 21:07:27,227 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-10-23 21:07:27,227 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-10-23 21:07:27,228 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-10-23 21:07:27,236 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:07:26" (1/1) ...
[2024-10-23 21:07:27,236 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:07:26" (1/1) ...
[2024-10-23 21:07:27,265 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:07:26" (1/1) ...
[2024-10-23 21:07:27,470 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].
[2024-10-23 21:07:27,471 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:07:26" (1/1) ...
[2024-10-23 21:07:27,471 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:07:26" (1/1) ...
[2024-10-23 21:07:27,584 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:07:26" (1/1) ...
[2024-10-23 21:07:27,609 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:07:26" (1/1) ...
[2024-10-23 21:07:27,627 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:07:26" (1/1) ...
[2024-10-23 21:07:27,641 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:07:26" (1/1) ...
[2024-10-23 21:07:27,680 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-10-23 21:07:27,681 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-10-23 21:07:27,682 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-10-23 21:07:27,682 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-10-23 21:07:27,683 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:07:26" (1/1) ...
[2024-10-23 21:07:27,687 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-23 21:07:27,695 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-23 21:07:27,708 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)
[2024-10-23 21:07:27,710 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
[2024-10-23 21:07:27,744 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-10-23 21:07:27,745 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-10-23 21:07:27,745 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-10-23 21:07:27,745 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-10-23 21:07:27,805 INFO  L238             CfgBuilder]: Building ICFG
[2024-10-23 21:07:27,807 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-10-23 21:07:30,839 INFO  L?                        ?]: Removed 702 outVars from TransFormulas that were not future-live.
[2024-10-23 21:07:30,839 INFO  L287             CfgBuilder]: Performing block encoding
[2024-10-23 21:07:30,888 INFO  L309             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-10-23 21:07:30,888 INFO  L314             CfgBuilder]: Removed 1 assume(true) statements.
[2024-10-23 21:07:30,891 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:07:30 BoogieIcfgContainer
[2024-10-23 21:07:30,891 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-10-23 21:07:30,893 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-10-23 21:07:30,893 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-10-23 21:07:30,896 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-10-23 21:07:30,896 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 09:07:25" (1/3) ...
[2024-10-23 21:07:30,897 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c2bf139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:07:30, skipping insertion in model container
[2024-10-23 21:07:30,897 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:07:26" (2/3) ...
[2024-10-23 21:07:30,897 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c2bf139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:07:30, skipping insertion in model container
[2024-10-23 21:07:30,897 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:07:30" (3/3) ...
[2024-10-23 21:07:30,898 INFO  L112   eAbstractionObserver]: Analyzing ICFG Problem12_label36.c
[2024-10-23 21:07:30,909 INFO  L209   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-10-23 21:07:30,909 INFO  L149   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-10-23 21:07:30,970 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-10-23 21:07:30,976 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;@5836ad37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-10-23 21:07:30,976 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-10-23 21:07:30,982 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 756 states, 754 states have (on average 1.993368700265252) internal successors, (1503), 755 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:07:30,987 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 57
[2024-10-23 21:07:30,987 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-23 21:07:30,988 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-23 21:07:30,988 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-23 21:07:30,991 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-23 21:07:30,992 INFO  L85        PathProgramCache]: Analyzing trace with hash -655684569, now seen corresponding path program 1 times
[2024-10-23 21:07:30,998 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-23 21:07:30,998 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158351384]
[2024-10-23 21:07:30,998 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-23 21:07:30,999 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-23 21:07:31,074 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-23 21:07:31,131 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-23 21:07:31,132 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-23 21:07:31,132 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158351384]
[2024-10-23 21:07:31,133 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158351384] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-23 21:07:31,133 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-23 21:07:31,133 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-23 21:07:31,134 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803226989]
[2024-10-23 21:07:31,134 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-23 21:07:31,137 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-10-23 21:07:31,137 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-23 21:07:31,160 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-10-23 21:07:31,161 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-10-23 21:07:31,164 INFO  L87              Difference]: Start difference. First operand  has 756 states, 754 states have (on average 1.993368700265252) internal successors, (1503), 755 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:07:31,224 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-23 21:07:31,225 INFO  L93              Difference]: Finished difference Result 1511 states and 3005 transitions.
[2024-10-23 21:07:31,226 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-10-23 21:07:31,227 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56
[2024-10-23 21:07:31,227 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-23 21:07:31,244 INFO  L225             Difference]: With dead ends: 1511
[2024-10-23 21:07:31,244 INFO  L226             Difference]: Without dead ends: 754
[2024-10-23 21:07:31,251 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-10-23 21:07:31,253 INFO  L432           NwaCegarLoop]: 1438 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-23 21:07:31,255 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1438 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-23 21:07:31,269 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 754 states.
[2024-10-23 21:07:31,307 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754.
[2024-10-23 21:07:31,309 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 754 states, 753 states have (on average 1.9096945551128819) internal successors, (1438), 753 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:07:31,311 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1438 transitions.
[2024-10-23 21:07:31,312 INFO  L78                 Accepts]: Start accepts. Automaton has 754 states and 1438 transitions. Word has length 56
[2024-10-23 21:07:31,312 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-23 21:07:31,313 INFO  L471      AbstractCegarLoop]: Abstraction has 754 states and 1438 transitions.
[2024-10-23 21:07:31,314 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:07:31,314 INFO  L276                IsEmpty]: Start isEmpty. Operand 754 states and 1438 transitions.
[2024-10-23 21:07:31,315 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 57
[2024-10-23 21:07:31,315 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-23 21:07:31,315 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-23 21:07:31,316 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-10-23 21:07:31,316 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-23 21:07:31,317 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-23 21:07:31,317 INFO  L85        PathProgramCache]: Analyzing trace with hash 958028186, now seen corresponding path program 1 times
[2024-10-23 21:07:31,317 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-23 21:07:31,317 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665844604]
[2024-10-23 21:07:31,318 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-23 21:07:31,318 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-23 21:07:31,352 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-23 21:07:31,467 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-23 21:07:31,467 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-23 21:07:31,467 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665844604]
[2024-10-23 21:07:31,468 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665844604] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-23 21:07:31,468 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-23 21:07:31,468 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-23 21:07:31,468 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806205012]
[2024-10-23 21:07:31,468 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-23 21:07:31,472 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-23 21:07:31,472 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-23 21:07:31,473 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-23 21:07:31,473 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-23 21:07:31,473 INFO  L87              Difference]: Start difference. First operand 754 states and 1438 transitions. Second operand  has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:07:34,098 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-23 21:07:34,098 INFO  L93              Difference]: Finished difference Result 2258 states and 4311 transitions.
[2024-10-23 21:07:34,099 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-23 21:07:34,099 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56
[2024-10-23 21:07:34,100 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-23 21:07:34,105 INFO  L225             Difference]: With dead ends: 2258
[2024-10-23 21:07:34,105 INFO  L226             Difference]: Without dead ends: 1505
[2024-10-23 21:07:34,106 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-23 21:07:34,107 INFO  L432           NwaCegarLoop]: 419 mSDtfsCounter, 761 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2275 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 2866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time
[2024-10-23 21:07:34,109 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 426 Invalid, 2866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2275 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time]
[2024-10-23 21:07:34,111 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1505 states.
[2024-10-23 21:07:34,140 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1505.
[2024-10-23 21:07:34,142 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1505 states, 1504 states have (on average 1.6389627659574468) internal successors, (2465), 1504 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:07:34,145 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2465 transitions.
[2024-10-23 21:07:34,146 INFO  L78                 Accepts]: Start accepts. Automaton has 1505 states and 2465 transitions. Word has length 56
[2024-10-23 21:07:34,146 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-23 21:07:34,146 INFO  L471      AbstractCegarLoop]: Abstraction has 1505 states and 2465 transitions.
[2024-10-23 21:07:34,146 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:07:34,146 INFO  L276                IsEmpty]: Start isEmpty. Operand 1505 states and 2465 transitions.
[2024-10-23 21:07:34,149 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 128
[2024-10-23 21:07:34,149 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-23 21:07:34,150 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-23 21:07:34,150 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-10-23 21:07:34,150 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-23 21:07:34,151 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-23 21:07:34,151 INFO  L85        PathProgramCache]: Analyzing trace with hash 360389802, now seen corresponding path program 1 times
[2024-10-23 21:07:34,151 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-23 21:07:34,151 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621313522]
[2024-10-23 21:07:34,151 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-23 21:07:34,151 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-23 21:07:34,194 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-23 21:07:34,439 INFO  L134       CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-23 21:07:34,440 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-23 21:07:34,440 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621313522]
[2024-10-23 21:07:34,441 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621313522] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-23 21:07:34,441 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-23 21:07:34,441 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-23 21:07:34,441 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849279597]
[2024-10-23 21:07:34,441 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-23 21:07:34,442 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-10-23 21:07:34,442 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-23 21:07:34,442 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-10-23 21:07:34,443 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-10-23 21:07:34,444 INFO  L87              Difference]: Start difference. First operand 1505 states and 2465 transitions. Second operand  has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:07:37,468 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-23 21:07:37,468 INFO  L93              Difference]: Finished difference Result 4550 states and 7430 transitions.
[2024-10-23 21:07:37,468 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-10-23 21:07:37,468 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127
[2024-10-23 21:07:37,469 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-23 21:07:37,476 INFO  L225             Difference]: With dead ends: 4550
[2024-10-23 21:07:37,477 INFO  L226             Difference]: Without dead ends: 3009
[2024-10-23 21:07:37,478 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-10-23 21:07:37,479 INFO  L432           NwaCegarLoop]: 637 mSDtfsCounter, 705 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3077 mSolverCounterSat, 728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 3805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 728 IncrementalHoareTripleChecker+Valid, 3077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time
[2024-10-23 21:07:37,479 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 651 Invalid, 3805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [728 Valid, 3077 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time]
[2024-10-23 21:07:37,482 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3009 states.
[2024-10-23 21:07:37,507 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3009 to 3007.
[2024-10-23 21:07:37,510 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3007 states, 3006 states have (on average 1.3419827012641383) internal successors, (4034), 3006 states have internal predecessors, (4034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:07:37,513 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3007 states to 3007 states and 4034 transitions.
[2024-10-23 21:07:37,514 INFO  L78                 Accepts]: Start accepts. Automaton has 3007 states and 4034 transitions. Word has length 127
[2024-10-23 21:07:37,514 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-23 21:07:37,515 INFO  L471      AbstractCegarLoop]: Abstraction has 3007 states and 4034 transitions.
[2024-10-23 21:07:37,515 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:07:37,517 INFO  L276                IsEmpty]: Start isEmpty. Operand 3007 states and 4034 transitions.
[2024-10-23 21:07:37,521 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 166
[2024-10-23 21:07:37,522 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-23 21:07:37,523 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-23 21:07:37,523 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-10-23 21:07:37,523 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-23 21:07:37,523 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-23 21:07:37,524 INFO  L85        PathProgramCache]: Analyzing trace with hash -1829534551, now seen corresponding path program 1 times
[2024-10-23 21:07:37,524 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-23 21:07:37,524 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752449753]
[2024-10-23 21:07:37,524 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-23 21:07:37,524 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-23 21:07:37,556 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-23 21:07:37,792 INFO  L134       CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-23 21:07:37,792 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-23 21:07:37,792 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752449753]
[2024-10-23 21:07:37,792 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752449753] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-23 21:07:37,792 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-23 21:07:37,792 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-23 21:07:37,792 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391086192]
[2024-10-23 21:07:37,792 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-23 21:07:37,793 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-10-23 21:07:37,793 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-23 21:07:37,794 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-10-23 21:07:37,794 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-10-23 21:07:37,794 INFO  L87              Difference]: Start difference. First operand 3007 states and 4034 transitions. Second operand  has 4 states, 4 states have (on average 41.25) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:07:40,860 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-23 21:07:40,860 INFO  L93              Difference]: Finished difference Result 9768 states and 12894 transitions.
[2024-10-23 21:07:40,861 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-10-23 21:07:40,861 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 41.25) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165
[2024-10-23 21:07:40,861 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-23 21:07:40,881 INFO  L225             Difference]: With dead ends: 9768
[2024-10-23 21:07:40,881 INFO  L226             Difference]: Without dead ends: 6762
[2024-10-23 21:07:40,883 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-10-23 21:07:40,884 INFO  L432           NwaCegarLoop]: 435 mSDtfsCounter, 2093 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 4275 mSolverCounterSat, 567 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2093 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 4842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 567 IncrementalHoareTripleChecker+Valid, 4275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time
[2024-10-23 21:07:40,884 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [2093 Valid, 449 Invalid, 4842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [567 Valid, 4275 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time]
[2024-10-23 21:07:40,891 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6762 states.
[2024-10-23 21:07:40,945 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6762 to 6762.
[2024-10-23 21:07:40,953 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6762 states, 6761 states have (on average 1.28782724449046) internal successors, (8707), 6761 states have internal predecessors, (8707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:07:40,960 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6762 states to 6762 states and 8707 transitions.
[2024-10-23 21:07:40,960 INFO  L78                 Accepts]: Start accepts. Automaton has 6762 states and 8707 transitions. Word has length 165
[2024-10-23 21:07:40,961 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-23 21:07:40,961 INFO  L471      AbstractCegarLoop]: Abstraction has 6762 states and 8707 transitions.
[2024-10-23 21:07:40,961 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 41.25) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:07:40,962 INFO  L276                IsEmpty]: Start isEmpty. Operand 6762 states and 8707 transitions.
[2024-10-23 21:07:40,967 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 269
[2024-10-23 21:07:40,967 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-23 21:07:40,968 INFO  L215           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-23 21:07:40,968 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-10-23 21:07:40,968 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-23 21:07:40,969 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-23 21:07:40,969 INFO  L85        PathProgramCache]: Analyzing trace with hash 604205675, now seen corresponding path program 1 times
[2024-10-23 21:07:40,969 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-23 21:07:40,969 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270093426]
[2024-10-23 21:07:40,969 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-23 21:07:40,969 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-23 21:07:41,013 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-23 21:07:41,301 INFO  L134       CoverageAnalysis]: Checked inductivity of 179 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked.
[2024-10-23 21:07:41,301 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-23 21:07:41,302 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270093426]
[2024-10-23 21:07:41,302 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270093426] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-23 21:07:41,303 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-23 21:07:41,303 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-23 21:07:41,303 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041442683]
[2024-10-23 21:07:41,303 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-23 21:07:41,304 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-10-23 21:07:41,304 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-23 21:07:41,305 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-10-23 21:07:41,305 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-10-23 21:07:41,305 INFO  L87              Difference]: Start difference. First operand 6762 states and 8707 transitions. Second operand  has 4 states, 4 states have (on average 49.75) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:07:43,987 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-23 21:07:43,987 INFO  L93              Difference]: Finished difference Result 15815 states and 21399 transitions.
[2024-10-23 21:07:43,987 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-10-23 21:07:43,987 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 49.75) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 268
[2024-10-23 21:07:43,988 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-23 21:07:44,007 INFO  L225             Difference]: With dead ends: 15815
[2024-10-23 21:07:44,007 INFO  L226             Difference]: Without dead ends: 9768
[2024-10-23 21:07:44,013 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-10-23 21:07:44,014 INFO  L432           NwaCegarLoop]: 477 mSDtfsCounter, 850 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3466 mSolverCounterSat, 553 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 4019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 553 IncrementalHoareTripleChecker+Valid, 3466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time
[2024-10-23 21:07:44,014 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 491 Invalid, 4019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [553 Valid, 3466 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time]
[2024-10-23 21:07:44,021 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9768 states.
[2024-10-23 21:07:44,112 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9768 to 9766.
[2024-10-23 21:07:44,123 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9766 states, 9765 states have (on average 1.273425499231951) internal successors, (12435), 9765 states have internal predecessors, (12435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:07:44,135 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9766 states to 9766 states and 12435 transitions.
[2024-10-23 21:07:44,136 INFO  L78                 Accepts]: Start accepts. Automaton has 9766 states and 12435 transitions. Word has length 268
[2024-10-23 21:07:44,137 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-23 21:07:44,137 INFO  L471      AbstractCegarLoop]: Abstraction has 9766 states and 12435 transitions.
[2024-10-23 21:07:44,137 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 49.75) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:07:44,138 INFO  L276                IsEmpty]: Start isEmpty. Operand 9766 states and 12435 transitions.
[2024-10-23 21:07:44,140 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 272
[2024-10-23 21:07:44,140 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-23 21:07:44,140 INFO  L215           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-23 21:07:44,140 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-10-23 21:07:44,140 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-23 21:07:44,141 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-23 21:07:44,141 INFO  L85        PathProgramCache]: Analyzing trace with hash -746750411, now seen corresponding path program 1 times
[2024-10-23 21:07:44,141 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-23 21:07:44,141 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740264371]
[2024-10-23 21:07:44,141 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-23 21:07:44,141 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-23 21:07:44,174 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-23 21:07:44,292 INFO  L134       CoverageAnalysis]: Checked inductivity of 182 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked.
[2024-10-23 21:07:44,292 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-23 21:07:44,292 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740264371]
[2024-10-23 21:07:44,292 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740264371] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-23 21:07:44,292 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-23 21:07:44,293 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-23 21:07:44,293 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207668722]
[2024-10-23 21:07:44,293 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-23 21:07:44,293 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-23 21:07:44,294 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-23 21:07:44,294 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-23 21:07:44,294 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-23 21:07:44,294 INFO  L87              Difference]: Start difference. First operand 9766 states and 12435 transitions. Second operand  has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:07:46,398 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-23 21:07:46,399 INFO  L93              Difference]: Finished difference Result 26290 states and 34161 transitions.
[2024-10-23 21:07:46,401 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-23 21:07:46,401 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 271
[2024-10-23 21:07:46,401 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-23 21:07:46,434 INFO  L225             Difference]: With dead ends: 26290
[2024-10-23 21:07:46,434 INFO  L226             Difference]: Without dead ends: 17276
[2024-10-23 21:07:46,444 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-23 21:07:46,446 INFO  L432           NwaCegarLoop]: 590 mSDtfsCounter, 619 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2022 mSolverCounterSat, 794 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 2816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 794 IncrementalHoareTripleChecker+Valid, 2022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2024-10-23 21:07:46,448 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 596 Invalid, 2816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [794 Valid, 2022 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2024-10-23 21:07:46,460 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 17276 states.
[2024-10-23 21:07:46,588 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 17276 to 17276.
[2024-10-23 21:07:46,612 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 17276 states, 17275 states have (on average 1.1980318379160637) internal successors, (20696), 17275 states have internal predecessors, (20696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:07:46,629 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17276 states to 17276 states and 20696 transitions.
[2024-10-23 21:07:46,630 INFO  L78                 Accepts]: Start accepts. Automaton has 17276 states and 20696 transitions. Word has length 271
[2024-10-23 21:07:46,630 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-23 21:07:46,631 INFO  L471      AbstractCegarLoop]: Abstraction has 17276 states and 20696 transitions.
[2024-10-23 21:07:46,632 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:07:46,632 INFO  L276                IsEmpty]: Start isEmpty. Operand 17276 states and 20696 transitions.
[2024-10-23 21:07:46,634 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 287
[2024-10-23 21:07:46,634 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-23 21:07:46,635 INFO  L215           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-23 21:07:46,635 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-10-23 21:07:46,635 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-23 21:07:46,635 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-23 21:07:46,635 INFO  L85        PathProgramCache]: Analyzing trace with hash 67993700, now seen corresponding path program 1 times
[2024-10-23 21:07:46,635 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-23 21:07:46,636 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100926559]
[2024-10-23 21:07:46,636 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-23 21:07:46,636 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-23 21:07:46,666 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-23 21:07:46,806 INFO  L134       CoverageAnalysis]: Checked inductivity of 193 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2024-10-23 21:07:46,806 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-23 21:07:46,806 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100926559]
[2024-10-23 21:07:46,807 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100926559] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-23 21:07:46,807 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-23 21:07:46,807 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-23 21:07:46,807 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246413222]
[2024-10-23 21:07:46,807 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-23 21:07:46,808 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-23 21:07:46,808 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-23 21:07:46,808 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-23 21:07:46,808 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-23 21:07:46,808 INFO  L87              Difference]: Start difference. First operand 17276 states and 20696 transitions. Second operand  has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:07:48,713 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-23 21:07:48,713 INFO  L93              Difference]: Finished difference Result 33800 states and 40635 transitions.
[2024-10-23 21:07:48,713 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-23 21:07:48,713 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 286
[2024-10-23 21:07:48,714 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-23 21:07:48,737 INFO  L225             Difference]: With dead ends: 33800
[2024-10-23 21:07:48,738 INFO  L226             Difference]: Without dead ends: 17276
[2024-10-23 21:07:48,751 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-23 21:07:48,754 INFO  L432           NwaCegarLoop]: 974 mSDtfsCounter, 770 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2291 mSolverCounterSat, 392 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 2683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 392 IncrementalHoareTripleChecker+Valid, 2291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2024-10-23 21:07:48,754 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 981 Invalid, 2683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [392 Valid, 2291 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2024-10-23 21:07:48,767 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 17276 states.
[2024-10-23 21:07:48,869 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 17276 to 17276.
[2024-10-23 21:07:48,885 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 17276 states, 17275 states have (on average 1.1577424023154848) internal successors, (20000), 17275 states have internal predecessors, (20000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:07:48,905 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17276 states to 17276 states and 20000 transitions.
[2024-10-23 21:07:48,905 INFO  L78                 Accepts]: Start accepts. Automaton has 17276 states and 20000 transitions. Word has length 286
[2024-10-23 21:07:48,907 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-23 21:07:48,907 INFO  L471      AbstractCegarLoop]: Abstraction has 17276 states and 20000 transitions.
[2024-10-23 21:07:48,907 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:07:48,907 INFO  L276                IsEmpty]: Start isEmpty. Operand 17276 states and 20000 transitions.
[2024-10-23 21:07:48,912 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 356
[2024-10-23 21:07:48,913 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-23 21:07:48,914 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-23 21:07:48,914 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-10-23 21:07:48,914 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-23 21:07:48,914 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-23 21:07:48,915 INFO  L85        PathProgramCache]: Analyzing trace with hash 947281467, now seen corresponding path program 1 times
[2024-10-23 21:07:48,915 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-23 21:07:48,915 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572899503]
[2024-10-23 21:07:48,915 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-23 21:07:48,915 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-23 21:07:48,952 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-23 21:07:49,133 INFO  L134       CoverageAnalysis]: Checked inductivity of 385 backedges. 301 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2024-10-23 21:07:49,133 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-23 21:07:49,133 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572899503]
[2024-10-23 21:07:49,134 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572899503] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-23 21:07:49,134 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-23 21:07:49,135 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-23 21:07:49,135 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084316653]
[2024-10-23 21:07:49,135 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-23 21:07:49,135 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-23 21:07:49,135 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-23 21:07:49,136 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-23 21:07:49,136 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-23 21:07:49,136 INFO  L87              Difference]: Start difference. First operand 17276 states and 20000 transitions. Second operand  has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:07:51,115 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-23 21:07:51,115 INFO  L93              Difference]: Finished difference Result 41310 states and 48606 transitions.
[2024-10-23 21:07:51,116 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-23 21:07:51,116 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 355
[2024-10-23 21:07:51,116 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-23 21:07:51,150 INFO  L225             Difference]: With dead ends: 41310
[2024-10-23 21:07:51,150 INFO  L226             Difference]: Without dead ends: 24786
[2024-10-23 21:07:51,164 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-23 21:07:51,165 INFO  L432           NwaCegarLoop]: 1194 mSDtfsCounter, 704 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2239 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 2544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 2239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2024-10-23 21:07:51,166 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 1201 Invalid, 2544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 2239 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2024-10-23 21:07:51,181 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 24786 states.
[2024-10-23 21:07:51,381 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 24786 to 24035.
[2024-10-23 21:07:51,401 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 24035 states, 24034 states have (on average 1.1449613048181742) internal successors, (27518), 24034 states have internal predecessors, (27518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:07:51,430 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24035 states to 24035 states and 27518 transitions.
[2024-10-23 21:07:51,430 INFO  L78                 Accepts]: Start accepts. Automaton has 24035 states and 27518 transitions. Word has length 355
[2024-10-23 21:07:51,431 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-23 21:07:51,431 INFO  L471      AbstractCegarLoop]: Abstraction has 24035 states and 27518 transitions.
[2024-10-23 21:07:51,431 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:07:51,431 INFO  L276                IsEmpty]: Start isEmpty. Operand 24035 states and 27518 transitions.
[2024-10-23 21:07:51,437 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 384
[2024-10-23 21:07:51,437 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-23 21:07:51,437 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-23 21:07:51,437 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-10-23 21:07:51,437 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-23 21:07:51,438 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-23 21:07:51,438 INFO  L85        PathProgramCache]: Analyzing trace with hash -1841932639, now seen corresponding path program 1 times
[2024-10-23 21:07:51,438 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-23 21:07:51,438 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608568352]
[2024-10-23 21:07:51,438 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-23 21:07:51,438 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-23 21:07:51,498 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-23 21:07:51,682 INFO  L134       CoverageAnalysis]: Checked inductivity of 417 backedges. 362 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked.
[2024-10-23 21:07:51,683 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-23 21:07:51,683 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608568352]
[2024-10-23 21:07:51,683 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608568352] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-23 21:07:51,683 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-23 21:07:51,683 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-23 21:07:51,683 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756906455]
[2024-10-23 21:07:51,683 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-23 21:07:51,684 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-23 21:07:51,684 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-23 21:07:51,685 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-23 21:07:51,685 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-23 21:07:51,685 INFO  L87              Difference]: Start difference. First operand 24035 states and 27518 transitions. Second operand  has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:07:53,972 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-23 21:07:53,972 INFO  L93              Difference]: Finished difference Result 60085 states and 68723 transitions.
[2024-10-23 21:07:53,973 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-23 21:07:53,973 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 383
[2024-10-23 21:07:53,973 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-23 21:07:54,000 INFO  L225             Difference]: With dead ends: 60085
[2024-10-23 21:07:54,000 INFO  L226             Difference]: Without dead ends: 36802
[2024-10-23 21:07:54,010 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-23 21:07:54,010 INFO  L432           NwaCegarLoop]: 1229 mSDtfsCounter, 637 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2612 mSolverCounterSat, 337 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 1236 SdHoareTripleChecker+Invalid, 2949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 337 IncrementalHoareTripleChecker+Valid, 2612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2024-10-23 21:07:54,010 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 1236 Invalid, 2949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [337 Valid, 2612 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2024-10-23 21:07:54,033 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 36802 states.
[2024-10-23 21:07:54,246 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 36802 to 35300.
[2024-10-23 21:07:54,278 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 35300 states, 35299 states have (on average 1.1341964361596646) internal successors, (40036), 35299 states have internal predecessors, (40036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:07:54,321 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 35300 states to 35300 states and 40036 transitions.
[2024-10-23 21:07:54,322 INFO  L78                 Accepts]: Start accepts. Automaton has 35300 states and 40036 transitions. Word has length 383
[2024-10-23 21:07:54,322 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-23 21:07:54,322 INFO  L471      AbstractCegarLoop]: Abstraction has 35300 states and 40036 transitions.
[2024-10-23 21:07:54,323 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:07:54,323 INFO  L276                IsEmpty]: Start isEmpty. Operand 35300 states and 40036 transitions.
[2024-10-23 21:07:54,328 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 385
[2024-10-23 21:07:54,329 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-23 21:07:54,329 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-23 21:07:54,329 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-10-23 21:07:54,329 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-23 21:07:54,330 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-23 21:07:54,330 INFO  L85        PathProgramCache]: Analyzing trace with hash -1038026608, now seen corresponding path program 1 times
[2024-10-23 21:07:54,330 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-23 21:07:54,330 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411906914]
[2024-10-23 21:07:54,330 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-23 21:07:54,331 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-23 21:07:54,368 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-23 21:07:54,500 INFO  L134       CoverageAnalysis]: Checked inductivity of 428 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked.
[2024-10-23 21:07:54,500 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-23 21:07:54,500 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411906914]
[2024-10-23 21:07:54,501 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411906914] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-23 21:07:54,501 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-23 21:07:54,501 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-23 21:07:54,501 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940257960]
[2024-10-23 21:07:54,501 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-23 21:07:54,501 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-23 21:07:54,501 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-23 21:07:54,502 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-23 21:07:54,502 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-23 21:07:54,502 INFO  L87              Difference]: Start difference. First operand 35300 states and 40036 transitions. Second operand  has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:07:56,366 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-23 21:07:56,366 INFO  L93              Difference]: Finished difference Result 78109 states and 88521 transitions.
[2024-10-23 21:07:56,366 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-23 21:07:56,366 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 384
[2024-10-23 21:07:56,367 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-23 21:07:56,402 INFO  L225             Difference]: With dead ends: 78109
[2024-10-23 21:07:56,403 INFO  L226             Difference]: Without dead ends: 39806
[2024-10-23 21:07:56,423 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-23 21:07:56,423 INFO  L432           NwaCegarLoop]: 1335 mSDtfsCounter, 717 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1971 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 2355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 1971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2024-10-23 21:07:56,424 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 1342 Invalid, 2355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 1971 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2024-10-23 21:07:56,450 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 39806 states.
[2024-10-23 21:07:56,667 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 39806 to 39055.
[2024-10-23 21:07:56,691 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 39055 states, 39054 states have (on average 1.1208582987658113) internal successors, (43774), 39054 states have internal predecessors, (43774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:07:56,724 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 39055 states to 39055 states and 43774 transitions.
[2024-10-23 21:07:56,724 INFO  L78                 Accepts]: Start accepts. Automaton has 39055 states and 43774 transitions. Word has length 384
[2024-10-23 21:07:56,725 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-23 21:07:56,725 INFO  L471      AbstractCegarLoop]: Abstraction has 39055 states and 43774 transitions.
[2024-10-23 21:07:56,725 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:07:56,725 INFO  L276                IsEmpty]: Start isEmpty. Operand 39055 states and 43774 transitions.
[2024-10-23 21:07:56,731 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 456
[2024-10-23 21:07:56,731 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-23 21:07:56,731 INFO  L215           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-23 21:07:56,731 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-10-23 21:07:56,731 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-23 21:07:56,731 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-23 21:07:56,732 INFO  L85        PathProgramCache]: Analyzing trace with hash 1891873048, now seen corresponding path program 1 times
[2024-10-23 21:07:56,732 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-23 21:07:56,732 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428194208]
[2024-10-23 21:07:56,732 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-23 21:07:56,732 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-23 21:07:56,773 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-23 21:07:56,991 INFO  L134       CoverageAnalysis]: Checked inductivity of 675 backedges. 367 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked.
[2024-10-23 21:07:56,991 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-23 21:07:56,991 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428194208]
[2024-10-23 21:07:56,991 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428194208] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-23 21:07:56,991 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-23 21:07:56,992 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-23 21:07:56,992 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306563591]
[2024-10-23 21:07:56,992 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-23 21:07:56,992 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-23 21:07:56,992 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-23 21:07:56,992 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-23 21:07:56,993 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-23 21:07:56,993 INFO  L87              Difference]: Start difference. First operand 39055 states and 43774 transitions. Second operand  has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:07:59,063 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-23 21:07:59,063 INFO  L93              Difference]: Finished difference Result 93880 states and 106520 transitions.
[2024-10-23 21:07:59,064 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-23 21:07:59,064 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 455
[2024-10-23 21:07:59,064 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-23 21:07:59,117 INFO  L225             Difference]: With dead ends: 93880
[2024-10-23 21:07:59,118 INFO  L226             Difference]: Without dead ends: 52573
[2024-10-23 21:07:59,145 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-23 21:07:59,146 INFO  L432           NwaCegarLoop]: 1282 mSDtfsCounter, 714 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2172 mSolverCounterSat, 587 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 2759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 587 IncrementalHoareTripleChecker+Valid, 2172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2024-10-23 21:07:59,146 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 1289 Invalid, 2759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [587 Valid, 2172 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2024-10-23 21:07:59,178 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 52573 states.
[2024-10-23 21:07:59,662 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 52573 to 46565.
[2024-10-23 21:07:59,689 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 46565 states, 46564 states have (on average 1.1123185293359676) internal successors, (51794), 46564 states have internal predecessors, (51794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:07:59,746 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 46565 states to 46565 states and 51794 transitions.
[2024-10-23 21:07:59,746 INFO  L78                 Accepts]: Start accepts. Automaton has 46565 states and 51794 transitions. Word has length 455
[2024-10-23 21:07:59,747 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-23 21:07:59,747 INFO  L471      AbstractCegarLoop]: Abstraction has 46565 states and 51794 transitions.
[2024-10-23 21:07:59,747 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:07:59,747 INFO  L276                IsEmpty]: Start isEmpty. Operand 46565 states and 51794 transitions.
[2024-10-23 21:07:59,756 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 471
[2024-10-23 21:07:59,757 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-23 21:07:59,757 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-23 21:07:59,757 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-10-23 21:07:59,757 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-23 21:07:59,758 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-23 21:07:59,758 INFO  L85        PathProgramCache]: Analyzing trace with hash 1454680039, now seen corresponding path program 1 times
[2024-10-23 21:07:59,758 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-23 21:07:59,758 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717147782]
[2024-10-23 21:07:59,758 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-23 21:07:59,758 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-23 21:07:59,804 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-23 21:07:59,960 INFO  L134       CoverageAnalysis]: Checked inductivity of 461 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked.
[2024-10-23 21:07:59,960 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-23 21:07:59,960 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717147782]
[2024-10-23 21:07:59,961 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717147782] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-23 21:07:59,961 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-23 21:07:59,961 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-23 21:07:59,961 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997265403]
[2024-10-23 21:07:59,961 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-23 21:07:59,961 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-23 21:07:59,962 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-23 21:07:59,962 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-23 21:07:59,962 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-23 21:07:59,962 INFO  L87              Difference]: Start difference. First operand 46565 states and 51794 transitions. Second operand  has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:08:02,128 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-23 21:08:02,129 INFO  L93              Difference]: Finished difference Result 98386 states and 109242 transitions.
[2024-10-23 21:08:02,129 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-23 21:08:02,129 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 470
[2024-10-23 21:08:02,130 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-23 21:08:02,183 INFO  L225             Difference]: With dead ends: 98386
[2024-10-23 21:08:02,183 INFO  L226             Difference]: Without dead ends: 52573
[2024-10-23 21:08:02,207 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-23 21:08:02,209 INFO  L432           NwaCegarLoop]: 1110 mSDtfsCounter, 727 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2352 mSolverCounterSat, 508 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 2860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 508 IncrementalHoareTripleChecker+Valid, 2352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2024-10-23 21:08:02,209 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 1117 Invalid, 2860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [508 Valid, 2352 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2024-10-23 21:08:02,233 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 52573 states.
[2024-10-23 21:08:02,508 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 52573 to 51071.
[2024-10-23 21:08:02,541 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 51071 states, 51070 states have (on average 1.0962208733111416) internal successors, (55984), 51070 states have internal predecessors, (55984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:08:02,587 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 51071 states to 51071 states and 55984 transitions.
[2024-10-23 21:08:02,588 INFO  L78                 Accepts]: Start accepts. Automaton has 51071 states and 55984 transitions. Word has length 470
[2024-10-23 21:08:02,588 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-23 21:08:02,588 INFO  L471      AbstractCegarLoop]: Abstraction has 51071 states and 55984 transitions.
[2024-10-23 21:08:02,588 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:08:02,588 INFO  L276                IsEmpty]: Start isEmpty. Operand 51071 states and 55984 transitions.
[2024-10-23 21:08:02,599 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 565
[2024-10-23 21:08:02,599 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-23 21:08:02,599 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-23 21:08:02,599 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-10-23 21:08:02,599 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-23 21:08:02,600 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-23 21:08:02,600 INFO  L85        PathProgramCache]: Analyzing trace with hash 468574232, now seen corresponding path program 1 times
[2024-10-23 21:08:02,600 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-23 21:08:02,600 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004240994]
[2024-10-23 21:08:02,600 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-23 21:08:02,600 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-23 21:08:02,655 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-23 21:08:03,136 INFO  L134       CoverageAnalysis]: Checked inductivity of 461 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked.
[2024-10-23 21:08:03,136 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-23 21:08:03,136 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004240994]
[2024-10-23 21:08:03,136 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004240994] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-23 21:08:03,136 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-23 21:08:03,137 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-23 21:08:03,137 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260721329]
[2024-10-23 21:08:03,137 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-23 21:08:03,137 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-23 21:08:03,137 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-23 21:08:03,138 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-23 21:08:03,138 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-23 21:08:03,138 INFO  L87              Difference]: Start difference. First operand 51071 states and 55984 transitions. Second operand  has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:08:05,487 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-23 21:08:05,487 INFO  L93              Difference]: Finished difference Result 127675 states and 141191 transitions.
[2024-10-23 21:08:05,488 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-23 21:08:05,488 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 564
[2024-10-23 21:08:05,488 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-23 21:08:05,650 INFO  L225             Difference]: With dead ends: 127675
[2024-10-23 21:08:05,650 INFO  L226             Difference]: Without dead ends: 77356
[2024-10-23 21:08:05,672 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-23 21:08:05,672 INFO  L432           NwaCegarLoop]: 1322 mSDtfsCounter, 719 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2382 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 2826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 2382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2024-10-23 21:08:05,673 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 1329 Invalid, 2826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 2382 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2024-10-23 21:08:05,706 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 77356 states.
[2024-10-23 21:08:06,274 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 77356 to 72850.
[2024-10-23 21:08:06,323 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 72850 states, 72849 states have (on average 1.0854095457727628) internal successors, (79071), 72849 states have internal predecessors, (79071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:08:06,388 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 72850 states to 72850 states and 79071 transitions.
[2024-10-23 21:08:06,388 INFO  L78                 Accepts]: Start accepts. Automaton has 72850 states and 79071 transitions. Word has length 564
[2024-10-23 21:08:06,389 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-23 21:08:06,389 INFO  L471      AbstractCegarLoop]: Abstraction has 72850 states and 79071 transitions.
[2024-10-23 21:08:06,389 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:08:06,389 INFO  L276                IsEmpty]: Start isEmpty. Operand 72850 states and 79071 transitions.
[2024-10-23 21:08:06,405 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 631
[2024-10-23 21:08:06,405 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-23 21:08:06,405 INFO  L215           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-23 21:08:06,405 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-10-23 21:08:06,405 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-23 21:08:06,406 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-23 21:08:06,406 INFO  L85        PathProgramCache]: Analyzing trace with hash 12228477, now seen corresponding path program 1 times
[2024-10-23 21:08:06,406 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-23 21:08:06,406 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691333221]
[2024-10-23 21:08:06,406 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-23 21:08:06,406 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-23 21:08:06,490 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-23 21:08:06,818 INFO  L134       CoverageAnalysis]: Checked inductivity of 1156 backedges. 862 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked.
[2024-10-23 21:08:06,818 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-23 21:08:06,819 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691333221]
[2024-10-23 21:08:06,819 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691333221] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-23 21:08:06,819 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-23 21:08:06,819 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-23 21:08:06,819 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162509879]
[2024-10-23 21:08:06,819 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-23 21:08:06,820 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-23 21:08:06,820 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-23 21:08:06,820 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-23 21:08:06,820 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-23 21:08:06,821 INFO  L87              Difference]: Start difference. First operand 72850 states and 79071 transitions. Second operand  has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:08:09,002 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-23 21:08:09,003 INFO  L93              Difference]: Finished difference Result 148703 states and 161282 transitions.
[2024-10-23 21:08:09,003 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-23 21:08:09,003 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 630
[2024-10-23 21:08:09,004 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-23 21:08:09,074 INFO  L225             Difference]: With dead ends: 148703
[2024-10-23 21:08:09,074 INFO  L226             Difference]: Without dead ends: 76605
[2024-10-23 21:08:09,109 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-23 21:08:09,110 INFO  L432           NwaCegarLoop]: 277 mSDtfsCounter, 734 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2256 mSolverCounterSat, 557 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 2813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 557 IncrementalHoareTripleChecker+Valid, 2256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2024-10-23 21:08:09,110 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 283 Invalid, 2813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [557 Valid, 2256 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2024-10-23 21:08:09,150 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 76605 states.
[2024-10-23 21:08:09,786 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 76605 to 72099.
[2024-10-23 21:08:09,833 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 72099 states, 72098 states have (on average 1.0819301506283114) internal successors, (78005), 72098 states have internal predecessors, (78005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:08:09,928 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 72099 states to 72099 states and 78005 transitions.
[2024-10-23 21:08:09,928 INFO  L78                 Accepts]: Start accepts. Automaton has 72099 states and 78005 transitions. Word has length 630
[2024-10-23 21:08:09,929 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-23 21:08:09,929 INFO  L471      AbstractCegarLoop]: Abstraction has 72099 states and 78005 transitions.
[2024-10-23 21:08:09,929 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:08:09,929 INFO  L276                IsEmpty]: Start isEmpty. Operand 72099 states and 78005 transitions.
[2024-10-23 21:08:09,951 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 642
[2024-10-23 21:08:09,951 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-23 21:08:09,952 INFO  L215           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-23 21:08:09,952 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-10-23 21:08:09,952 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-23 21:08:09,953 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-23 21:08:09,953 INFO  L85        PathProgramCache]: Analyzing trace with hash -1668445285, now seen corresponding path program 1 times
[2024-10-23 21:08:09,953 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-23 21:08:09,953 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657164343]
[2024-10-23 21:08:09,953 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-23 21:08:09,953 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-23 21:08:10,045 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-23 21:08:10,364 INFO  L134       CoverageAnalysis]: Checked inductivity of 1181 backedges. 880 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked.
[2024-10-23 21:08:10,365 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-23 21:08:10,365 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657164343]
[2024-10-23 21:08:10,365 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657164343] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-23 21:08:10,365 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-23 21:08:10,365 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-23 21:08:10,366 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579842738]
[2024-10-23 21:08:10,366 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-23 21:08:10,366 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-23 21:08:10,366 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-23 21:08:10,367 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-23 21:08:10,367 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-23 21:08:10,367 INFO  L87              Difference]: Start difference. First operand 72099 states and 78005 transitions. Second operand  has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:08:12,840 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-23 21:08:12,840 INFO  L93              Difference]: Finished difference Result 184000 states and 200161 transitions.
[2024-10-23 21:08:12,841 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-23 21:08:12,841 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 641
[2024-10-23 21:08:12,841 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-23 21:08:12,963 INFO  L225             Difference]: With dead ends: 184000
[2024-10-23 21:08:12,963 INFO  L226             Difference]: Without dead ends: 112653
[2024-10-23 21:08:12,995 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-23 21:08:12,996 INFO  L432           NwaCegarLoop]: 434 mSDtfsCounter, 709 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2210 mSolverCounterSat, 624 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 2834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 624 IncrementalHoareTripleChecker+Valid, 2210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2024-10-23 21:08:12,996 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 440 Invalid, 2834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [624 Valid, 2210 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2024-10-23 21:08:13,057 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 112653 states.
[2024-10-23 21:08:13,938 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 112653 to 108898.
[2024-10-23 21:08:14,005 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 108898 states, 108897 states have (on average 1.078835964259805) internal successors, (117482), 108897 states have internal predecessors, (117482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:08:14,106 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 108898 states to 108898 states and 117482 transitions.
[2024-10-23 21:08:14,107 INFO  L78                 Accepts]: Start accepts. Automaton has 108898 states and 117482 transitions. Word has length 641
[2024-10-23 21:08:14,107 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-23 21:08:14,107 INFO  L471      AbstractCegarLoop]: Abstraction has 108898 states and 117482 transitions.
[2024-10-23 21:08:14,107 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:08:14,107 INFO  L276                IsEmpty]: Start isEmpty. Operand 108898 states and 117482 transitions.
[2024-10-23 21:08:14,122 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 653
[2024-10-23 21:08:14,122 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-23 21:08:14,123 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-23 21:08:14,123 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-10-23 21:08:14,123 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-23 21:08:14,123 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-23 21:08:14,123 INFO  L85        PathProgramCache]: Analyzing trace with hash 1897937690, now seen corresponding path program 1 times
[2024-10-23 21:08:14,123 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-23 21:08:14,123 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501060823]
[2024-10-23 21:08:14,123 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-23 21:08:14,124 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-23 21:08:14,427 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-23 21:08:15,915 INFO  L134       CoverageAnalysis]: Checked inductivity of 541 backedges. 431 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-23 21:08:15,915 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-23 21:08:15,915 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501060823]
[2024-10-23 21:08:15,915 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501060823] provided 0 perfect and 1 imperfect interpolant sequences
[2024-10-23 21:08:15,915 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619808676]
[2024-10-23 21:08:15,916 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-23 21:08:15,916 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-23 21:08:15,916 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-23 21:08:15,918 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)
[2024-10-23 21:08:15,919 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-10-23 21:08:16,096 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-23 21:08:16,100 INFO  L255         TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-10-23 21:08:16,114 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-10-23 21:08:16,838 INFO  L134       CoverageAnalysis]: Checked inductivity of 541 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked.
[2024-10-23 21:08:16,838 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-10-23 21:08:16,838 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619808676] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-23 21:08:16,838 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-10-23 21:08:16,838 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8
[2024-10-23 21:08:16,838 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885653493]
[2024-10-23 21:08:16,839 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-23 21:08:16,839 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-10-23 21:08:16,839 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-23 21:08:16,840 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-10-23 21:08:16,840 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-10-23 21:08:16,841 INFO  L87              Difference]: Start difference. First operand 108898 states and 117482 transitions. Second operand  has 4 states, 4 states have (on average 98.25) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:08:20,858 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-23 21:08:20,858 INFO  L93              Difference]: Finished difference Result 333451 states and 361095 transitions.
[2024-10-23 21:08:20,858 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-10-23 21:08:20,859 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 98.25) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 652
[2024-10-23 21:08:20,859 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-23 21:08:21,104 INFO  L225             Difference]: With dead ends: 333451
[2024-10-23 21:08:21,104 INFO  L226             Difference]: Without dead ends: 225305
[2024-10-23 21:08:21,166 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 657 GetRequests, 651 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-10-23 21:08:21,166 INFO  L432           NwaCegarLoop]: 13 mSDtfsCounter, 1593 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 4681 mSolverCounterSat, 648 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1593 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 5329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 648 IncrementalHoareTripleChecker+Valid, 4681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time
[2024-10-23 21:08:21,166 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [1593 Valid, 27 Invalid, 5329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [648 Valid, 4681 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time]
[2024-10-23 21:08:21,303 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 225305 states.
[2024-10-23 21:08:23,259 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 225305 to 205026.
[2024-10-23 21:08:23,390 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 205026 states, 205025 states have (on average 1.081741251066943) internal successors, (221784), 205025 states have internal predecessors, (221784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:08:24,037 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 205026 states to 205026 states and 221784 transitions.
[2024-10-23 21:08:24,038 INFO  L78                 Accepts]: Start accepts. Automaton has 205026 states and 221784 transitions. Word has length 652
[2024-10-23 21:08:24,039 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-23 21:08:24,039 INFO  L471      AbstractCegarLoop]: Abstraction has 205026 states and 221784 transitions.
[2024-10-23 21:08:24,040 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 98.25) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:08:24,040 INFO  L276                IsEmpty]: Start isEmpty. Operand 205026 states and 221784 transitions.
[2024-10-23 21:08:24,056 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 669
[2024-10-23 21:08:24,059 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-23 21:08:24,059 INFO  L215           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-23 21:08:24,084 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-10-23 21:08:24,260 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,SelfDestructingSolverStorable15
[2024-10-23 21:08:24,261 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-23 21:08:24,261 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-23 21:08:24,261 INFO  L85        PathProgramCache]: Analyzing trace with hash 1486164520, now seen corresponding path program 1 times
[2024-10-23 21:08:24,261 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-23 21:08:24,261 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628121786]
[2024-10-23 21:08:24,261 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-23 21:08:24,261 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-23 21:08:24,329 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-23 21:08:24,843 INFO  L134       CoverageAnalysis]: Checked inductivity of 1255 backedges. 697 proven. 333 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked.
[2024-10-23 21:08:24,843 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-23 21:08:24,843 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628121786]
[2024-10-23 21:08:24,843 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628121786] provided 0 perfect and 1 imperfect interpolant sequences
[2024-10-23 21:08:24,843 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417796018]
[2024-10-23 21:08:24,844 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-23 21:08:24,844 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-23 21:08:24,844 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-23 21:08:24,846 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)
[2024-10-23 21:08:24,847 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-10-23 21:08:24,997 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-23 21:08:24,999 INFO  L255         TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-10-23 21:08:25,004 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-10-23 21:08:25,204 INFO  L134       CoverageAnalysis]: Checked inductivity of 1255 backedges. 656 proven. 0 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked.
[2024-10-23 21:08:25,205 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-10-23 21:08:25,205 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [417796018] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-23 21:08:25,205 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-10-23 21:08:25,205 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2024-10-23 21:08:25,205 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820155691]
[2024-10-23 21:08:25,205 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-23 21:08:25,206 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-23 21:08:25,206 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-23 21:08:25,206 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-23 21:08:25,207 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-10-23 21:08:25,207 INFO  L87              Difference]: Start difference. First operand 205026 states and 221784 transitions. Second operand  has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:08:28,146 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-23 21:08:28,146 INFO  L93              Difference]: Finished difference Result 397284 states and 430948 transitions.
[2024-10-23 21:08:28,146 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-23 21:08:28,147 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 668
[2024-10-23 21:08:28,147 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-23 21:08:28,457 INFO  L225             Difference]: With dead ends: 397284
[2024-10-23 21:08:28,457 INFO  L226             Difference]: Without dead ends: 223801
[2024-10-23 21:08:28,537 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 671 GetRequests, 667 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-10-23 21:08:28,538 INFO  L432           NwaCegarLoop]: 1107 mSDtfsCounter, 697 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2107 mSolverCounterSat, 535 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 2642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 535 IncrementalHoareTripleChecker+Valid, 2107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2024-10-23 21:08:28,538 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 1114 Invalid, 2642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [535 Valid, 2107 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2024-10-23 21:08:28,696 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 223801 states.
[2024-10-23 21:08:30,979 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 223801 to 190006.
[2024-10-23 21:08:31,070 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 190006 states, 190005 states have (on average 1.0817978474250678) internal successors, (205547), 190005 states have internal predecessors, (205547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:08:31,272 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 190006 states to 190006 states and 205547 transitions.
[2024-10-23 21:08:31,273 INFO  L78                 Accepts]: Start accepts. Automaton has 190006 states and 205547 transitions. Word has length 668
[2024-10-23 21:08:31,274 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-23 21:08:31,274 INFO  L471      AbstractCegarLoop]: Abstraction has 190006 states and 205547 transitions.
[2024-10-23 21:08:31,274 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:08:31,274 INFO  L276                IsEmpty]: Start isEmpty. Operand 190006 states and 205547 transitions.
[2024-10-23 21:08:31,306 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 830
[2024-10-23 21:08:31,306 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-23 21:08:31,307 INFO  L215           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-23 21:08:31,321 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-10-23 21:08:31,507 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,SelfDestructingSolverStorable16
[2024-10-23 21:08:31,508 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-23 21:08:31,508 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-23 21:08:31,509 INFO  L85        PathProgramCache]: Analyzing trace with hash -926679196, now seen corresponding path program 1 times
[2024-10-23 21:08:31,509 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-23 21:08:31,509 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795743917]
[2024-10-23 21:08:31,509 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-23 21:08:31,509 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-23 21:08:31,573 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-23 21:08:32,099 INFO  L134       CoverageAnalysis]: Checked inductivity of 889 backedges. 718 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked.
[2024-10-23 21:08:32,099 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-23 21:08:32,099 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795743917]
[2024-10-23 21:08:32,099 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795743917] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-23 21:08:32,099 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-23 21:08:32,099 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-23 21:08:32,099 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703912587]
[2024-10-23 21:08:32,100 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-23 21:08:32,100 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-23 21:08:32,100 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-23 21:08:32,101 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-23 21:08:32,101 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-23 21:08:32,101 INFO  L87              Difference]: Start difference. First operand 190006 states and 205547 transitions. Second operand  has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:08:35,045 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-23 21:08:35,046 INFO  L93              Difference]: Finished difference Result 431079 states and 468901 transitions.
[2024-10-23 21:08:35,046 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-23 21:08:35,046 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 829
[2024-10-23 21:08:35,047 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-23 21:08:35,367 INFO  L225             Difference]: With dead ends: 431079
[2024-10-23 21:08:35,368 INFO  L226             Difference]: Without dead ends: 241825
[2024-10-23 21:08:35,501 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-23 21:08:35,501 INFO  L432           NwaCegarLoop]: 1247 mSDtfsCounter, 668 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2201 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 2512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 2201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2024-10-23 21:08:35,502 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 1254 Invalid, 2512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 2201 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2024-10-23 21:08:35,699 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 241825 states.
[2024-10-23 21:08:38,045 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 241825 to 235817.
[2024-10-23 21:08:38,173 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 235817 states, 235816 states have (on average 1.073137530956339) internal successors, (253063), 235816 states have internal predecessors, (253063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:08:38,419 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 235817 states to 235817 states and 253063 transitions.
[2024-10-23 21:08:38,420 INFO  L78                 Accepts]: Start accepts. Automaton has 235817 states and 253063 transitions. Word has length 829
[2024-10-23 21:08:38,421 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-23 21:08:38,421 INFO  L471      AbstractCegarLoop]: Abstraction has 235817 states and 253063 transitions.
[2024-10-23 21:08:38,421 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:08:38,421 INFO  L276                IsEmpty]: Start isEmpty. Operand 235817 states and 253063 transitions.
[2024-10-23 21:08:38,888 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 894
[2024-10-23 21:08:38,889 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-23 21:08:38,891 INFO  L215           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-23 21:08:38,891 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-10-23 21:08:38,891 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-23 21:08:38,892 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-23 21:08:38,892 INFO  L85        PathProgramCache]: Analyzing trace with hash -207649596, now seen corresponding path program 1 times
[2024-10-23 21:08:38,892 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-23 21:08:38,892 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385489186]
[2024-10-23 21:08:38,892 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-23 21:08:38,893 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-23 21:08:39,154 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-23 21:08:40,085 INFO  L134       CoverageAnalysis]: Checked inductivity of 955 backedges. 628 proven. 229 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked.
[2024-10-23 21:08:40,085 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-23 21:08:40,085 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385489186]
[2024-10-23 21:08:40,085 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385489186] provided 0 perfect and 1 imperfect interpolant sequences
[2024-10-23 21:08:40,085 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411027710]
[2024-10-23 21:08:40,086 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-23 21:08:40,086 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-23 21:08:40,086 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-23 21:08:40,087 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)
[2024-10-23 21:08:40,088 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-10-23 21:08:40,282 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-23 21:08:40,285 INFO  L255         TraceCheckSpWp]: Trace formula consists of 1056 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-10-23 21:08:40,291 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-10-23 21:08:40,445 INFO  L134       CoverageAnalysis]: Checked inductivity of 955 backedges. 816 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked.
[2024-10-23 21:08:40,445 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-10-23 21:08:40,445 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [411027710] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-23 21:08:40,445 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-10-23 21:08:40,445 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5
[2024-10-23 21:08:40,445 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293214709]
[2024-10-23 21:08:40,445 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-23 21:08:40,447 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-23 21:08:40,447 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-23 21:08:40,448 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-23 21:08:40,448 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-10-23 21:08:40,448 INFO  L87              Difference]: Start difference. First operand 235817 states and 253063 transitions. Second operand  has 3 states, 3 states have (on average 252.0) internal successors, (756), 3 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:08:43,563 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-23 21:08:43,563 INFO  L93              Difference]: Finished difference Result 539972 states and 578741 transitions.
[2024-10-23 21:08:43,563 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-23 21:08:43,564 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 252.0) internal successors, (756), 3 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 893
[2024-10-23 21:08:43,564 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-23 21:08:43,566 INFO  L225             Difference]: With dead ends: 539972
[2024-10-23 21:08:43,566 INFO  L226             Difference]: Without dead ends: 0
[2024-10-23 21:08:43,685 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 896 GetRequests, 893 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-10-23 21:08:43,685 INFO  L432           NwaCegarLoop]: 943 mSDtfsCounter, 609 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2214 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 2874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 2214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2024-10-23 21:08:43,686 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 949 Invalid, 2874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 2214 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2024-10-23 21:08:43,686 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2024-10-23 21:08:43,686 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2024-10-23 21:08:43,686 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:08:43,686 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2024-10-23 21:08:43,687 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 893
[2024-10-23 21:08:43,687 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-23 21:08:43,687 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2024-10-23 21:08:43,687 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 252.0) internal successors, (756), 3 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-23 21:08:43,687 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2024-10-23 21:08:43,688 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2024-10-23 21:08:43,690 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-10-23 21:08:43,702 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2024-10-23 21:08:43,890 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-23 21:08:43,893 INFO  L407         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-23 21:08:43,895 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.