./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/Problem01_label12.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/Problem01_label12.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 8b3b52d0771d28687db0ecd40f35ba0cd5ac6eaf2a4275309beef5f48092d06e
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-4a390ef-m
[2024-10-23 20:17:44,556 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-10-23 20:17:44,642 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-10-23 20:17:44,646 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-10-23 20:17:44,647 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-10-23 20:17:44,674 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-10-23 20:17:44,675 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-10-23 20:17:44,675 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-10-23 20:17:44,676 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-10-23 20:17:44,677 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-10-23 20:17:44,678 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-10-23 20:17:44,678 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-10-23 20:17:44,679 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-10-23 20:17:44,679 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-10-23 20:17:44,679 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-10-23 20:17:44,680 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-10-23 20:17:44,680 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-10-23 20:17:44,683 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-10-23 20:17:44,683 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-10-23 20:17:44,684 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-10-23 20:17:44,684 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-10-23 20:17:44,684 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-10-23 20:17:44,684 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-10-23 20:17:44,685 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-10-23 20:17:44,685 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-10-23 20:17:44,685 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-10-23 20:17:44,685 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-10-23 20:17:44,685 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-10-23 20:17:44,686 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-10-23 20:17:44,686 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-10-23 20:17:44,686 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-10-23 20:17:44,686 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-10-23 20:17:44,686 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-23 20:17:44,687 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-10-23 20:17:44,687 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-10-23 20:17:44,687 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-10-23 20:17:44,687 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-10-23 20:17:44,687 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-10-23 20:17:44,687 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-10-23 20:17:44,688 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-10-23 20:17:44,688 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-10-23 20:17:44,690 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-10-23 20:17:44,690 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 -> 8b3b52d0771d28687db0ecd40f35ba0cd5ac6eaf2a4275309beef5f48092d06e
[2024-10-23 20:17:45,005 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-10-23 20:17:45,031 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-10-23 20:17:45,034 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-10-23 20:17:45,035 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-10-23 20:17:45,035 INFO  L274        PluginConnector]: CDTParser initialized
[2024-10-23 20:17:45,036 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label12.c
[2024-10-23 20:17:46,444 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-10-23 20:17:46,723 INFO  L384              CDTParser]: Found 1 translation units.
[2024-10-23 20:17:46,724 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label12.c
[2024-10-23 20:17:46,738 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32c857814/95a4ace09fae4327bd6b273f855dda33/FLAG07b684f69
[2024-10-23 20:17:47,027 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32c857814/95a4ace09fae4327bd6b273f855dda33
[2024-10-23 20:17:47,030 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-10-23 20:17:47,031 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-10-23 20:17:47,034 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-10-23 20:17:47,034 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-10-23 20:17:47,040 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-10-23 20:17:47,040 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:17:47" (1/1) ...
[2024-10-23 20:17:47,041 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70738505 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:17:47, skipping insertion in model container
[2024-10-23 20:17:47,041 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:17:47" (1/1) ...
[2024-10-23 20:17:47,091 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-10-23 20:17:47,456 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/Problem01_label12.c[20469,20482]
[2024-10-23 20:17:47,498 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-10-23 20:17:47,516 INFO  L200         MainTranslator]: Completed pre-run
[2024-10-23 20:17:47,635 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/Problem01_label12.c[20469,20482]
[2024-10-23 20:17:47,672 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-10-23 20:17:47,690 INFO  L204         MainTranslator]: Completed translation
[2024-10-23 20:17:47,691 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:17:47 WrapperNode
[2024-10-23 20:17:47,691 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-10-23 20:17:47,692 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-10-23 20:17:47,692 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-10-23 20:17:47,692 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-10-23 20:17:47,699 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:17:47" (1/1) ...
[2024-10-23 20:17:47,716 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:17:47" (1/1) ...
[2024-10-23 20:17:47,763 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 658
[2024-10-23 20:17:47,764 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-10-23 20:17:47,764 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-10-23 20:17:47,764 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-10-23 20:17:47,765 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-10-23 20:17:47,775 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:17:47" (1/1) ...
[2024-10-23 20:17:47,775 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:17:47" (1/1) ...
[2024-10-23 20:17:47,779 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:17:47" (1/1) ...
[2024-10-23 20:17:47,802 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 20:17:47,802 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:17:47" (1/1) ...
[2024-10-23 20:17:47,802 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:17:47" (1/1) ...
[2024-10-23 20:17:47,822 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:17:47" (1/1) ...
[2024-10-23 20:17:47,832 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:17:47" (1/1) ...
[2024-10-23 20:17:47,837 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:17:47" (1/1) ...
[2024-10-23 20:17:47,841 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:17:47" (1/1) ...
[2024-10-23 20:17:47,850 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-10-23 20:17:47,851 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-10-23 20:17:47,851 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-10-23 20:17:47,851 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-10-23 20:17:47,852 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:17:47" (1/1) ...
[2024-10-23 20:17:47,860 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-23 20:17:47,871 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-23 20:17:47,887 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 20:17:47,896 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 20:17:47,940 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-10-23 20:17:47,941 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-10-23 20:17:47,941 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-10-23 20:17:47,941 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-10-23 20:17:48,031 INFO  L238             CfgBuilder]: Building ICFG
[2024-10-23 20:17:48,033 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-10-23 20:17:48,997 INFO  L?                        ?]: Removed 75 outVars from TransFormulas that were not future-live.
[2024-10-23 20:17:48,997 INFO  L287             CfgBuilder]: Performing block encoding
[2024-10-23 20:17:49,057 INFO  L309             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-10-23 20:17:49,057 INFO  L314             CfgBuilder]: Removed 1 assume(true) statements.
[2024-10-23 20:17:49,058 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:17:49 BoogieIcfgContainer
[2024-10-23 20:17:49,058 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-10-23 20:17:49,060 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-10-23 20:17:49,060 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-10-23 20:17:49,063 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-10-23 20:17:49,064 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 08:17:47" (1/3) ...
[2024-10-23 20:17:49,064 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@499a597e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:17:49, skipping insertion in model container
[2024-10-23 20:17:49,065 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:17:47" (2/3) ...
[2024-10-23 20:17:49,065 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@499a597e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:17:49, skipping insertion in model container
[2024-10-23 20:17:49,066 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:17:49" (3/3) ...
[2024-10-23 20:17:49,067 INFO  L112   eAbstractionObserver]: Analyzing ICFG Problem01_label12.c
[2024-10-23 20:17:49,081 INFO  L209   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-10-23 20:17:49,081 INFO  L149   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-10-23 20:17:49,142 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-10-23 20:17:49,148 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;@3d12b79c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-10-23 20:17:49,148 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-10-23 20:17:49,154 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 136 states, 134 states have (on average 1.9776119402985075) internal successors, (265), 135 states have internal predecessors, (265), 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 20:17:49,163 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 120
[2024-10-23 20:17:49,164 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-23 20:17:49,164 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:17:49,165 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-23 20:17:49,169 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-23 20:17:49,170 INFO  L85        PathProgramCache]: Analyzing trace with hash -1517250736, now seen corresponding path program 1 times
[2024-10-23 20:17:49,180 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-23 20:17:49,180 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429159842]
[2024-10-23 20:17:49,181 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-23 20:17:49,181 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-23 20:17:49,363 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-23 20:17:49,592 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 20:17:49,593 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-23 20:17:49,593 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429159842]
[2024-10-23 20:17:49,594 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429159842] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-23 20:17:49,594 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-23 20:17:49,594 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-23 20:17:49,596 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739706255]
[2024-10-23 20:17:49,597 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-23 20:17:49,602 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-10-23 20:17:49,602 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-23 20:17:49,621 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-10-23 20:17:49,622 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-10-23 20:17:49,624 INFO  L87              Difference]: Start difference. First operand  has 136 states, 134 states have (on average 1.9776119402985075) internal successors, (265), 135 states have internal predecessors, (265), 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 59.5) internal successors, (119), 2 states have internal predecessors, (119), 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 20:17:49,655 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-23 20:17:49,655 INFO  L93              Difference]: Finished difference Result 271 states and 529 transitions.
[2024-10-23 20:17:49,657 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-10-23 20:17:49,658 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 59.5) internal successors, (119), 2 states have internal predecessors, (119), 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 119
[2024-10-23 20:17:49,658 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-23 20:17:49,666 INFO  L225             Difference]: With dead ends: 271
[2024-10-23 20:17:49,666 INFO  L226             Difference]: Without dead ends: 134
[2024-10-23 20:17:49,669 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 20:17:49,672 INFO  L432           NwaCegarLoop]: 200 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, 200 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 20:17:49,672 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-23 20:17:49,687 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 134 states.
[2024-10-23 20:17:49,703 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134.
[2024-10-23 20:17:49,705 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 134 states, 133 states have (on average 1.5037593984962405) internal successors, (200), 133 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 20:17:49,707 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 200 transitions.
[2024-10-23 20:17:49,708 INFO  L78                 Accepts]: Start accepts. Automaton has 134 states and 200 transitions. Word has length 119
[2024-10-23 20:17:49,712 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-23 20:17:49,712 INFO  L471      AbstractCegarLoop]: Abstraction has 134 states and 200 transitions.
[2024-10-23 20:17:49,713 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 59.5) internal successors, (119), 2 states have internal predecessors, (119), 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 20:17:49,713 INFO  L276                IsEmpty]: Start isEmpty. Operand 134 states and 200 transitions.
[2024-10-23 20:17:49,717 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 120
[2024-10-23 20:17:49,719 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-23 20:17:49,720 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:17:49,720 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-10-23 20:17:49,720 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-23 20:17:49,721 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-23 20:17:49,721 INFO  L85        PathProgramCache]: Analyzing trace with hash -1016979537, now seen corresponding path program 1 times
[2024-10-23 20:17:49,721 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-23 20:17:49,722 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479257210]
[2024-10-23 20:17:49,722 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-23 20:17:49,722 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-23 20:17:49,778 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-23 20:17:50,009 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 20:17:50,010 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-23 20:17:50,010 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479257210]
[2024-10-23 20:17:50,010 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479257210] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-23 20:17:50,010 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-23 20:17:50,010 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-23 20:17:50,010 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512072402]
[2024-10-23 20:17:50,010 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-23 20:17:50,012 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-23 20:17:50,015 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-23 20:17:50,015 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-23 20:17:50,017 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-23 20:17:50,017 INFO  L87              Difference]: Start difference. First operand 134 states and 200 transitions. Second operand  has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 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 20:17:50,570 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-23 20:17:50,571 INFO  L93              Difference]: Finished difference Result 398 states and 597 transitions.
[2024-10-23 20:17:50,571 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-23 20:17:50,571 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 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 119
[2024-10-23 20:17:50,572 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-23 20:17:50,574 INFO  L225             Difference]: With dead ends: 398
[2024-10-23 20:17:50,574 INFO  L226             Difference]: Without dead ends: 265
[2024-10-23 20:17:50,575 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 20:17:50,576 INFO  L432           NwaCegarLoop]: 24 mSDtfsCounter, 36 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-10-23 20:17:50,576 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 29 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-10-23 20:17:50,579 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 265 states.
[2024-10-23 20:17:50,595 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265.
[2024-10-23 20:17:50,596 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 265 states, 264 states have (on average 1.4356060606060606) internal successors, (379), 264 states have internal predecessors, (379), 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 20:17:50,597 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 379 transitions.
[2024-10-23 20:17:50,597 INFO  L78                 Accepts]: Start accepts. Automaton has 265 states and 379 transitions. Word has length 119
[2024-10-23 20:17:50,598 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-23 20:17:50,598 INFO  L471      AbstractCegarLoop]: Abstraction has 265 states and 379 transitions.
[2024-10-23 20:17:50,598 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 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 20:17:50,599 INFO  L276                IsEmpty]: Start isEmpty. Operand 265 states and 379 transitions.
[2024-10-23 20:17:50,601 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 126
[2024-10-23 20:17:50,601 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-23 20:17:50,601 INFO  L215           NwaCegarLoop]: trace histogram [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]
[2024-10-23 20:17:50,601 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-10-23 20:17:50,602 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-23 20:17:50,602 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-23 20:17:50,602 INFO  L85        PathProgramCache]: Analyzing trace with hash 669089858, now seen corresponding path program 1 times
[2024-10-23 20:17:50,603 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-23 20:17:50,603 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794862103]
[2024-10-23 20:17:50,603 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-23 20:17:50,603 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-23 20:17:50,638 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-23 20:17:50,746 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-23 20:17:50,746 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-23 20:17:50,746 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794862103]
[2024-10-23 20:17:50,746 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794862103] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-23 20:17:50,747 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-23 20:17:50,747 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-23 20:17:50,747 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940781091]
[2024-10-23 20:17:50,747 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-23 20:17:50,747 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-23 20:17:50,748 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-23 20:17:50,748 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-23 20:17:50,749 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-23 20:17:50,749 INFO  L87              Difference]: Start difference. First operand 265 states and 379 transitions. Second operand  has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 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 20:17:51,189 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-23 20:17:51,189 INFO  L93              Difference]: Finished difference Result 791 states and 1134 transitions.
[2024-10-23 20:17:51,189 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-23 20:17:51,190 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 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 125
[2024-10-23 20:17:51,190 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-23 20:17:51,193 INFO  L225             Difference]: With dead ends: 791
[2024-10-23 20:17:51,193 INFO  L226             Difference]: Without dead ends: 527
[2024-10-23 20:17:51,194 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 20:17:51,195 INFO  L432           NwaCegarLoop]: 30 mSDtfsCounter, 142 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-10-23 20:17:51,196 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 34 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-10-23 20:17:51,197 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 527 states.
[2024-10-23 20:17:51,226 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527.
[2024-10-23 20:17:51,227 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 527 states, 526 states have (on average 1.3460076045627376) internal successors, (708), 526 states have internal predecessors, (708), 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 20:17:51,231 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 708 transitions.
[2024-10-23 20:17:51,232 INFO  L78                 Accepts]: Start accepts. Automaton has 527 states and 708 transitions. Word has length 125
[2024-10-23 20:17:51,232 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-23 20:17:51,232 INFO  L471      AbstractCegarLoop]: Abstraction has 527 states and 708 transitions.
[2024-10-23 20:17:51,233 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 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 20:17:51,233 INFO  L276                IsEmpty]: Start isEmpty. Operand 527 states and 708 transitions.
[2024-10-23 20:17:51,236 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 127
[2024-10-23 20:17:51,236 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-23 20:17:51,236 INFO  L215           NwaCegarLoop]: trace histogram [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]
[2024-10-23 20:17:51,237 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-10-23 20:17:51,237 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-23 20:17:51,237 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-23 20:17:51,238 INFO  L85        PathProgramCache]: Analyzing trace with hash 1175705474, now seen corresponding path program 1 times
[2024-10-23 20:17:51,238 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-23 20:17:51,238 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006364892]
[2024-10-23 20:17:51,238 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-23 20:17:51,238 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-23 20:17:51,310 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-23 20:17:51,652 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-23 20:17:51,652 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-23 20:17:51,652 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006364892]
[2024-10-23 20:17:51,653 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006364892] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-23 20:17:51,653 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-23 20:17:51,653 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-23 20:17:51,653 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488482138]
[2024-10-23 20:17:51,656 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-23 20:17:51,657 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-10-23 20:17:51,657 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-23 20:17:51,658 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-10-23 20:17:51,659 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-10-23 20:17:51,660 INFO  L87              Difference]: Start difference. First operand 527 states and 708 transitions. Second operand  has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 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 20:17:52,288 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-23 20:17:52,289 INFO  L93              Difference]: Finished difference Result 1410 states and 1881 transitions.
[2024-10-23 20:17:52,289 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-10-23 20:17:52,289 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 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 126
[2024-10-23 20:17:52,290 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-23 20:17:52,292 INFO  L225             Difference]: With dead ends: 1410
[2024-10-23 20:17:52,292 INFO  L226             Difference]: Without dead ends: 789
[2024-10-23 20:17:52,295 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 20:17:52,296 INFO  L432           NwaCegarLoop]: 68 mSDtfsCounter, 130 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-10-23 20:17:52,296 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 77 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-10-23 20:17:52,297 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 789 states.
[2024-10-23 20:17:52,310 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 789.
[2024-10-23 20:17:52,311 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 789 states, 788 states have (on average 1.1637055837563453) internal successors, (917), 788 states have internal predecessors, (917), 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 20:17:52,313 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 917 transitions.
[2024-10-23 20:17:52,313 INFO  L78                 Accepts]: Start accepts. Automaton has 789 states and 917 transitions. Word has length 126
[2024-10-23 20:17:52,313 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-23 20:17:52,314 INFO  L471      AbstractCegarLoop]: Abstraction has 789 states and 917 transitions.
[2024-10-23 20:17:52,314 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 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 20:17:52,314 INFO  L276                IsEmpty]: Start isEmpty. Operand 789 states and 917 transitions.
[2024-10-23 20:17:52,317 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 132
[2024-10-23 20:17:52,317 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-23 20:17:52,317 INFO  L215           NwaCegarLoop]: trace histogram [3, 3, 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]
[2024-10-23 20:17:52,317 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-10-23 20:17:52,317 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-23 20:17:52,318 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-23 20:17:52,318 INFO  L85        PathProgramCache]: Analyzing trace with hash 1069913301, now seen corresponding path program 1 times
[2024-10-23 20:17:52,318 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-23 20:17:52,318 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359657300]
[2024-10-23 20:17:52,318 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-23 20:17:52,318 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-23 20:17:52,352 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-23 20:17:52,496 INFO  L134       CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2024-10-23 20:17:52,498 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-23 20:17:52,498 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359657300]
[2024-10-23 20:17:52,498 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359657300] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-23 20:17:52,498 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-23 20:17:52,499 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-23 20:17:52,499 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022425931]
[2024-10-23 20:17:52,499 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-23 20:17:52,499 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-23 20:17:52,500 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-23 20:17:52,502 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-23 20:17:52,502 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-23 20:17:52,503 INFO  L87              Difference]: Start difference. First operand 789 states and 917 transitions. Second operand  has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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 20:17:52,835 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-23 20:17:52,836 INFO  L93              Difference]: Finished difference Result 1577 states and 1858 transitions.
[2024-10-23 20:17:52,837 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-23 20:17:52,838 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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 131
[2024-10-23 20:17:52,838 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-23 20:17:52,841 INFO  L225             Difference]: With dead ends: 1577
[2024-10-23 20:17:52,841 INFO  L226             Difference]: Without dead ends: 920
[2024-10-23 20:17:52,842 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 20:17:52,846 INFO  L432           NwaCegarLoop]: 39 mSDtfsCounter, 129 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-10-23 20:17:52,847 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 43 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-10-23 20:17:52,851 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 920 states.
[2024-10-23 20:17:52,864 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 920.
[2024-10-23 20:17:52,865 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 920 states, 919 states have (on average 1.1534276387377584) internal successors, (1060), 919 states have internal predecessors, (1060), 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 20:17:52,868 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1060 transitions.
[2024-10-23 20:17:52,868 INFO  L78                 Accepts]: Start accepts. Automaton has 920 states and 1060 transitions. Word has length 131
[2024-10-23 20:17:52,869 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-23 20:17:52,869 INFO  L471      AbstractCegarLoop]: Abstraction has 920 states and 1060 transitions.
[2024-10-23 20:17:52,869 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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 20:17:52,870 INFO  L276                IsEmpty]: Start isEmpty. Operand 920 states and 1060 transitions.
[2024-10-23 20:17:52,872 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 141
[2024-10-23 20:17:52,872 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-23 20:17:52,873 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 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]
[2024-10-23 20:17:52,873 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-10-23 20:17:52,873 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-23 20:17:52,873 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-23 20:17:52,874 INFO  L85        PathProgramCache]: Analyzing trace with hash 170244851, now seen corresponding path program 1 times
[2024-10-23 20:17:52,874 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-23 20:17:52,874 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420120376]
[2024-10-23 20:17:52,874 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-23 20:17:52,874 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-23 20:17:52,903 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-23 20:17:53,003 INFO  L134       CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2024-10-23 20:17:53,004 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-23 20:17:53,004 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420120376]
[2024-10-23 20:17:53,004 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420120376] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-23 20:17:53,004 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-23 20:17:53,004 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-23 20:17:53,004 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219088689]
[2024-10-23 20:17:53,005 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-23 20:17:53,005 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-23 20:17:53,005 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-23 20:17:53,006 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-23 20:17:53,006 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-23 20:17:53,006 INFO  L87              Difference]: Start difference. First operand 920 states and 1060 transitions. Second operand  has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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 20:17:53,384 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-23 20:17:53,384 INFO  L93              Difference]: Finished difference Result 2363 states and 2731 transitions.
[2024-10-23 20:17:53,385 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-23 20:17:53,386 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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 140
[2024-10-23 20:17:53,386 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-23 20:17:53,390 INFO  L225             Difference]: With dead ends: 2363
[2024-10-23 20:17:53,391 INFO  L226             Difference]: Without dead ends: 1575
[2024-10-23 20:17:53,392 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 20:17:53,393 INFO  L432           NwaCegarLoop]: 13 mSDtfsCounter, 134 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-10-23 20:17:53,393 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 17 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-10-23 20:17:53,395 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1575 states.
[2024-10-23 20:17:53,414 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1182.
[2024-10-23 20:17:53,415 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1182 states, 1181 states have (on average 1.1507197290431836) internal successors, (1359), 1181 states have internal predecessors, (1359), 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 20:17:53,418 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1359 transitions.
[2024-10-23 20:17:53,419 INFO  L78                 Accepts]: Start accepts. Automaton has 1182 states and 1359 transitions. Word has length 140
[2024-10-23 20:17:53,419 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-23 20:17:53,419 INFO  L471      AbstractCegarLoop]: Abstraction has 1182 states and 1359 transitions.
[2024-10-23 20:17:53,419 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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 20:17:53,420 INFO  L276                IsEmpty]: Start isEmpty. Operand 1182 states and 1359 transitions.
[2024-10-23 20:17:53,422 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 147
[2024-10-23 20:17:53,422 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-23 20:17:53,422 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 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]
[2024-10-23 20:17:53,423 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-10-23 20:17:53,423 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-23 20:17:53,423 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-23 20:17:53,423 INFO  L85        PathProgramCache]: Analyzing trace with hash 440744228, now seen corresponding path program 1 times
[2024-10-23 20:17:53,424 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-23 20:17:53,424 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159073008]
[2024-10-23 20:17:53,424 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-23 20:17:53,424 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-23 20:17:53,451 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-23 20:17:53,585 INFO  L134       CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2024-10-23 20:17:53,585 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-23 20:17:53,586 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159073008]
[2024-10-23 20:17:53,586 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159073008] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-23 20:17:53,586 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-23 20:17:53,586 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-23 20:17:53,587 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719691145]
[2024-10-23 20:17:53,587 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-23 20:17:53,587 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-10-23 20:17:53,587 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-23 20:17:53,588 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-10-23 20:17:53,588 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-10-23 20:17:53,588 INFO  L87              Difference]: Start difference. First operand 1182 states and 1359 transitions. Second operand  has 4 states, 4 states have (on average 36.0) internal successors, (144), 3 states have internal predecessors, (144), 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 20:17:54,157 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-23 20:17:54,157 INFO  L93              Difference]: Finished difference Result 2494 states and 2924 transitions.
[2024-10-23 20:17:54,158 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-10-23 20:17:54,158 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 36.0) internal successors, (144), 3 states have internal predecessors, (144), 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 146
[2024-10-23 20:17:54,158 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-23 20:17:54,163 INFO  L225             Difference]: With dead ends: 2494
[2024-10-23 20:17:54,163 INFO  L226             Difference]: Without dead ends: 1444
[2024-10-23 20:17:54,164 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 20:17:54,165 INFO  L432           NwaCegarLoop]: 24 mSDtfsCounter, 261 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-10-23 20:17:54,165 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 32 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-10-23 20:17:54,167 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1444 states.
[2024-10-23 20:17:54,186 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1444.
[2024-10-23 20:17:54,189 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1444 states, 1443 states have (on average 1.1448371448371448) internal successors, (1652), 1443 states have internal predecessors, (1652), 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 20:17:54,191 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 1652 transitions.
[2024-10-23 20:17:54,192 INFO  L78                 Accepts]: Start accepts. Automaton has 1444 states and 1652 transitions. Word has length 146
[2024-10-23 20:17:54,192 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-23 20:17:54,192 INFO  L471      AbstractCegarLoop]: Abstraction has 1444 states and 1652 transitions.
[2024-10-23 20:17:54,193 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 36.0) internal successors, (144), 3 states have internal predecessors, (144), 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 20:17:54,193 INFO  L276                IsEmpty]: Start isEmpty. Operand 1444 states and 1652 transitions.
[2024-10-23 20:17:54,195 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 161
[2024-10-23 20:17:54,195 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-23 20:17:54,196 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:17:54,196 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-10-23 20:17:54,196 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-23 20:17:54,197 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-23 20:17:54,197 INFO  L85        PathProgramCache]: Analyzing trace with hash 1168721473, now seen corresponding path program 1 times
[2024-10-23 20:17:54,197 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-23 20:17:54,197 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591426114]
[2024-10-23 20:17:54,197 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-23 20:17:54,198 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-23 20:17:54,227 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-23 20:17:54,384 INFO  L134       CoverageAnalysis]: Checked inductivity of 54 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2024-10-23 20:17:54,385 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-23 20:17:54,385 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591426114]
[2024-10-23 20:17:54,385 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591426114] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-23 20:17:54,385 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-23 20:17:54,385 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-23 20:17:54,385 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323474482]
[2024-10-23 20:17:54,386 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-23 20:17:54,386 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-10-23 20:17:54,386 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-23 20:17:54,387 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-10-23 20:17:54,387 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-10-23 20:17:54,387 INFO  L87              Difference]: Start difference. First operand 1444 states and 1652 transitions. Second operand  has 4 states, 4 states have (on average 39.5) internal successors, (158), 3 states have internal predecessors, (158), 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 20:17:54,954 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-23 20:17:54,954 INFO  L93              Difference]: Finished difference Result 3542 states and 4042 transitions.
[2024-10-23 20:17:54,954 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-10-23 20:17:54,955 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 39.5) internal successors, (158), 3 states have internal predecessors, (158), 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 160
[2024-10-23 20:17:54,955 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-23 20:17:54,962 INFO  L225             Difference]: With dead ends: 3542
[2024-10-23 20:17:54,962 INFO  L226             Difference]: Without dead ends: 2099
[2024-10-23 20:17:54,964 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 20:17:54,966 INFO  L432           NwaCegarLoop]: 28 mSDtfsCounter, 252 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-10-23 20:17:54,967 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 37 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-10-23 20:17:54,970 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2099 states.
[2024-10-23 20:17:54,994 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2099 to 1837.
[2024-10-23 20:17:54,996 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1837 states, 1836 states have (on average 1.1198257080610021) internal successors, (2056), 1836 states have internal predecessors, (2056), 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 20:17:54,999 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2056 transitions.
[2024-10-23 20:17:55,000 INFO  L78                 Accepts]: Start accepts. Automaton has 1837 states and 2056 transitions. Word has length 160
[2024-10-23 20:17:55,000 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-23 20:17:55,000 INFO  L471      AbstractCegarLoop]: Abstraction has 1837 states and 2056 transitions.
[2024-10-23 20:17:55,001 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 39.5) internal successors, (158), 3 states have internal predecessors, (158), 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 20:17:55,001 INFO  L276                IsEmpty]: Start isEmpty. Operand 1837 states and 2056 transitions.
[2024-10-23 20:17:55,004 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 181
[2024-10-23 20:17:55,004 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-23 20:17:55,004 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:17:55,005 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-10-23 20:17:55,005 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-23 20:17:55,006 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-23 20:17:55,006 INFO  L85        PathProgramCache]: Analyzing trace with hash -1316358991, now seen corresponding path program 1 times
[2024-10-23 20:17:55,006 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-23 20:17:55,006 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049025607]
[2024-10-23 20:17:55,006 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-23 20:17:55,007 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-23 20:17:55,042 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-23 20:17:55,319 INFO  L134       CoverageAnalysis]: Checked inductivity of 77 backedges. 60 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2024-10-23 20:17:55,319 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-23 20:17:55,319 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049025607]
[2024-10-23 20:17:55,319 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049025607] provided 0 perfect and 1 imperfect interpolant sequences
[2024-10-23 20:17:55,319 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298501514]
[2024-10-23 20:17:55,320 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-23 20:17:55,320 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-23 20:17:55,320 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-23 20:17:55,322 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 20:17:55,323 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 20:17:55,435 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-23 20:17:55,438 INFO  L255         TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-10-23 20:17:55,445 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-10-23 20:17:55,639 INFO  L134       CoverageAnalysis]: Checked inductivity of 77 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked.
[2024-10-23 20:17:55,643 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-10-23 20:17:55,643 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [298501514] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-23 20:17:55,643 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-10-23 20:17:55,643 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5
[2024-10-23 20:17:55,643 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032015724]
[2024-10-23 20:17:55,644 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-23 20:17:55,644 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-23 20:17:55,644 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-23 20:17:55,645 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-23 20:17:55,645 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-10-23 20:17:55,645 INFO  L87              Difference]: Start difference. First operand 1837 states and 2056 transitions. Second operand  has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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 20:17:56,032 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-23 20:17:56,032 INFO  L93              Difference]: Finished difference Result 3804 states and 4253 transitions.
[2024-10-23 20:17:56,033 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-23 20:17:56,033 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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 180
[2024-10-23 20:17:56,034 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-23 20:17:56,038 INFO  L225             Difference]: With dead ends: 3804
[2024-10-23 20:17:56,039 INFO  L226             Difference]: Without dead ends: 1706
[2024-10-23 20:17:56,041 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-10-23 20:17:56,043 INFO  L432           NwaCegarLoop]: 164 mSDtfsCounter, 21 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-10-23 20:17:56,044 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 169 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-10-23 20:17:56,046 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1706 states.
[2024-10-23 20:17:56,065 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1575.
[2024-10-23 20:17:56,067 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1575 states, 1574 states have (on average 1.0984752223634053) internal successors, (1729), 1574 states have internal predecessors, (1729), 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 20:17:56,070 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 1729 transitions.
[2024-10-23 20:17:56,070 INFO  L78                 Accepts]: Start accepts. Automaton has 1575 states and 1729 transitions. Word has length 180
[2024-10-23 20:17:56,071 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-23 20:17:56,071 INFO  L471      AbstractCegarLoop]: Abstraction has 1575 states and 1729 transitions.
[2024-10-23 20:17:56,071 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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 20:17:56,071 INFO  L276                IsEmpty]: Start isEmpty. Operand 1575 states and 1729 transitions.
[2024-10-23 20:17:56,074 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 200
[2024-10-23 20:17:56,075 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-23 20:17:56,075 INFO  L215           NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:17:56,095 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 20:17:56,279 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-23 20:17:56,280 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-23 20:17:56,280 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-23 20:17:56,280 INFO  L85        PathProgramCache]: Analyzing trace with hash -969696723, now seen corresponding path program 1 times
[2024-10-23 20:17:56,280 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-23 20:17:56,281 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116864429]
[2024-10-23 20:17:56,281 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-23 20:17:56,281 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-23 20:17:56,324 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-23 20:17:56,609 INFO  L134       CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-23 20:17:56,609 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-23 20:17:56,609 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116864429]
[2024-10-23 20:17:56,609 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116864429] provided 0 perfect and 1 imperfect interpolant sequences
[2024-10-23 20:17:56,609 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259486728]
[2024-10-23 20:17:56,609 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-23 20:17:56,609 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-23 20:17:56,609 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-23 20:17:56,611 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 20:17:56,612 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 20:17:56,726 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-23 20:17:56,728 INFO  L255         TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-10-23 20:17:56,735 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-10-23 20:17:56,905 INFO  L134       CoverageAnalysis]: Checked inductivity of 115 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2024-10-23 20:17:56,905 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-10-23 20:17:56,906 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [259486728] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-23 20:17:56,906 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-10-23 20:17:56,906 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2024-10-23 20:17:56,906 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429843313]
[2024-10-23 20:17:56,906 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-23 20:17:56,907 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-23 20:17:56,907 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-23 20:17:56,907 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-23 20:17:56,907 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-10-23 20:17:56,908 INFO  L87              Difference]: Start difference. First operand 1575 states and 1729 transitions. Second operand  has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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 20:17:57,255 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-23 20:17:57,255 INFO  L93              Difference]: Finished difference Result 3147 states and 3473 transitions.
[2024-10-23 20:17:57,256 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-23 20:17:57,256 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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 199
[2024-10-23 20:17:57,257 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-23 20:17:57,257 INFO  L225             Difference]: With dead ends: 3147
[2024-10-23 20:17:57,257 INFO  L226             Difference]: Without dead ends: 0
[2024-10-23 20:17:57,259 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-10-23 20:17:57,260 INFO  L432           NwaCegarLoop]: 163 mSDtfsCounter, 17 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-10-23 20:17:57,260 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 167 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-10-23 20:17:57,261 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2024-10-23 20:17:57,261 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2024-10-23 20:17:57,261 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 20:17:57,261 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2024-10-23 20:17:57,261 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 199
[2024-10-23 20:17:57,261 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-23 20:17:57,262 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2024-10-23 20:17:57,262 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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 20:17:57,262 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2024-10-23 20:17:57,262 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2024-10-23 20:17:57,265 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-10-23 20:17:57,281 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2024-10-23 20:17:57,465 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2024-10-23 20:17:57,469 INFO  L407         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-23 20:17:57,472 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2024-10-23 20:17:57,646 INFO  L165   ceAbstractionStarter]: Computing trace abstraction results
[2024-10-23 20:17:57,662 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 08:17:57 BoogieIcfgContainer
[2024-10-23 20:17:57,663 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-10-23 20:17:57,663 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-10-23 20:17:57,663 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-10-23 20:17:57,663 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-10-23 20:17:57,664 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:17:49" (3/4) ...
[2024-10-23 20:17:57,666 INFO  L139         WitnessPrinter]: Generating witness for correct program
[2024-10-23 20:17:57,682 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges
[2024-10-23 20:17:57,683 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2024-10-23 20:17:57,684 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2024-10-23 20:17:57,685 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2024-10-23 20:17:57,818 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-10-23 20:17:57,819 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2024-10-23 20:17:57,819 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-10-23 20:17:57,819 INFO  L158              Benchmark]: Toolchain (without parser) took 10788.12ms. Allocated memory was 163.6MB in the beginning and 251.7MB in the end (delta: 88.1MB). Free memory was 106.5MB in the beginning and 193.8MB in the end (delta: -87.3MB). Peak memory consumption was 269.0kB. Max. memory is 16.1GB.
[2024-10-23 20:17:57,820 INFO  L158              Benchmark]: CDTParser took 0.08ms. Allocated memory is still 96.5MB. Free memory was 57.8MB in the beginning and 57.7MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-10-23 20:17:57,820 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 657.28ms. Allocated memory is still 163.6MB. Free memory was 105.9MB in the beginning and 126.3MB in the end (delta: -20.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB.
[2024-10-23 20:17:57,820 INFO  L158              Benchmark]: Boogie Procedure Inliner took 71.54ms. Allocated memory is still 163.6MB. Free memory was 126.3MB in the beginning and 120.0MB in the end (delta: 6.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-10-23 20:17:57,821 INFO  L158              Benchmark]: Boogie Preprocessor took 86.17ms. Allocated memory is still 163.6MB. Free memory was 120.0MB in the beginning and 115.4MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-10-23 20:17:57,821 INFO  L158              Benchmark]: RCFGBuilder took 1206.58ms. Allocated memory is still 163.6MB. Free memory was 114.6MB in the beginning and 88.1MB in the end (delta: 26.5MB). Peak memory consumption was 59.9MB. Max. memory is 16.1GB.
[2024-10-23 20:17:57,822 INFO  L158              Benchmark]: TraceAbstraction took 8602.63ms. Allocated memory was 163.6MB in the beginning and 251.7MB in the end (delta: 88.1MB). Free memory was 88.1MB in the beginning and 206.4MB in the end (delta: -118.3MB). Peak memory consumption was 110.3MB. Max. memory is 16.1GB.
[2024-10-23 20:17:57,822 INFO  L158              Benchmark]: Witness Printer took 155.74ms. Allocated memory is still 251.7MB. Free memory was 206.4MB in the beginning and 193.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
[2024-10-23 20:17:57,824 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.08ms. Allocated memory is still 96.5MB. Free memory was 57.8MB in the beginning and 57.7MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 657.28ms. Allocated memory is still 163.6MB. Free memory was 105.9MB in the beginning and 126.3MB in the end (delta: -20.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 71.54ms. Allocated memory is still 163.6MB. Free memory was 126.3MB in the beginning and 120.0MB in the end (delta: 6.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 86.17ms. Allocated memory is still 163.6MB. Free memory was 120.0MB in the beginning and 115.4MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * RCFGBuilder took 1206.58ms. Allocated memory is still 163.6MB. Free memory was 114.6MB in the beginning and 88.1MB in the end (delta: 26.5MB). Peak memory consumption was 59.9MB. Max. memory is 16.1GB.
 * TraceAbstraction took 8602.63ms. Allocated memory was 163.6MB in the beginning and 251.7MB in the end (delta: 88.1MB). Free memory was 88.1MB in the beginning and 206.4MB in the end (delta: -118.3MB). Peak memory consumption was 110.3MB. Max. memory is 16.1GB.
 * Witness Printer took 155.74ms. Allocated memory is still 251.7MB. Free memory was 206.4MB in the beginning and 193.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Line: 546]: a call to reach_error is unreachable
    For all program executions holds that a call to reach_error is unreachable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 136 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.3s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1122 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1122 mSDsluCounter, 805 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 536 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3478 IncrementalHoareTripleChecker+Invalid, 4014 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 536 mSolverCounterUnsat, 753 mSDtfsCounter, 3478 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 404 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1837occurred in iteration=8, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 786 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1824 NumberOfCodeBlocks, 1824 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1812 ConstructedInterpolants, 0 QuantifiedInterpolants, 5588 SizeOfPredicates, 0 NumberOfNonLiveVariables, 687 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 525/537 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
  - InvariantResult [Line: 593]: Loop Invariant
    Derived loop invariant: (((((((((a21 == 1) && (a17 == 1)) && (15 <= a8)) || ((a8 <= 13) && (a16 <= 5))) || ((a8 <= 13) && (a20 == 1))) || (((a17 <= 0) && (a21 == 1)) && (15 <= a8))) || (((a17 <= 0) && (a21 == 1)) && (a16 <= 5))) || (((a17 <= 0) && (a21 == 1)) && (a20 == 1))) || (((((a12 == 8) && (a21 == 1)) && (a17 == 1)) && (a16 <= 4)) && (a20 == 1)))
RESULT: Ultimate proved your program to be correct!
[2024-10-23 20:17:57,855 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE