./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label25.c --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version 803cd42f
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 ../sv-benchmarks/c/eca-rers2012/Problem01_label25.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 9eecaebfc7fdff6c78546d77961205ec398f6828a79f10a4e7e47a08f024b3d8
--- Real Ultimate output ---
This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m
[2024-11-21 21:18:41,895 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-21 21:18:41,960 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-21 21:18:41,965 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-21 21:18:41,965 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-21 21:18:41,991 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-21 21:18:41,992 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-21 21:18:41,992 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-21 21:18:41,993 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-21 21:18:41,994 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-21 21:18:41,994 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-21 21:18:41,994 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-21 21:18:41,994 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-21 21:18:41,995 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-21 21:18:41,996 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-21 21:18:41,996 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-21 21:18:41,996 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-21 21:18:41,997 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-21 21:18:41,997 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-21 21:18:41,997 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-21 21:18:41,997 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-21 21:18:42,000 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-21 21:18:42,000 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-21 21:18:42,000 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-21 21:18:42,000 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-21 21:18:42,001 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-21 21:18:42,001 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-21 21:18:42,001 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-21 21:18:42,001 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-21 21:18:42,001 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-21 21:18:42,001 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-21 21:18:42,002 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-21 21:18:42,002 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-21 21:18:42,002 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-21 21:18:42,002 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-21 21:18:42,002 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-21 21:18:42,002 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-21 21:18:42,002 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-21 21:18:42,003 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-21 21:18:42,003 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-21 21:18:42,003 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-21 21:18:42,004 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-21 21:18:42,004 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 -> 9eecaebfc7fdff6c78546d77961205ec398f6828a79f10a4e7e47a08f024b3d8
[2024-11-21 21:18:42,199 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-21 21:18:42,219 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-21 21:18:42,221 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-21 21:18:42,222 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-21 21:18:42,222 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-21 21:18:42,223 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label25.c
[2024-11-21 21:18:43,507 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-21 21:18:43,699 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-21 21:18:43,700 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label25.c
[2024-11-21 21:18:43,713 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bc4db7f9/51cba8b50f0e48fdac9c1fe5e0e400bc/FLAG0deaaa97c
[2024-11-21 21:18:44,055 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bc4db7f9/51cba8b50f0e48fdac9c1fe5e0e400bc
[2024-11-21 21:18:44,056 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-21 21:18:44,057 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-21 21:18:44,058 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-21 21:18:44,058 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-21 21:18:44,064 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-21 21:18:44,064 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:18:44" (1/1) ...
[2024-11-21 21:18:44,065 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f2beb01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:44, skipping insertion in model container
[2024-11-21 21:18:44,065 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:18:44" (1/1) ...
[2024-11-21 21:18:44,100 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-21 21:18:44,356 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label25.c[20346,20359]
[2024-11-21 21:18:44,379 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-21 21:18:44,392 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-21 21:18:44,485 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label25.c[20346,20359]
[2024-11-21 21:18:44,490 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-21 21:18:44,503 INFO  L204         MainTranslator]: Completed translation
[2024-11-21 21:18:44,503 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:44 WrapperNode
[2024-11-21 21:18:44,503 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-21 21:18:44,504 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-21 21:18:44,504 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-21 21:18:44,504 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-21 21:18:44,509 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:44" (1/1) ...
[2024-11-21 21:18:44,521 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:44" (1/1) ...
[2024-11-21 21:18:44,560 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 658
[2024-11-21 21:18:44,560 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-21 21:18:44,561 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-21 21:18:44,561 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-21 21:18:44,561 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-21 21:18:44,569 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:44" (1/1) ...
[2024-11-21 21:18:44,569 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:44" (1/1) ...
[2024-11-21 21:18:44,572 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:44" (1/1) ...
[2024-11-21 21:18:44,587 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-11-21 21:18:44,587 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:44" (1/1) ...
[2024-11-21 21:18:44,587 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:44" (1/1) ...
[2024-11-21 21:18:44,599 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:44" (1/1) ...
[2024-11-21 21:18:44,608 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:44" (1/1) ...
[2024-11-21 21:18:44,611 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:44" (1/1) ...
[2024-11-21 21:18:44,620 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:44" (1/1) ...
[2024-11-21 21:18:44,625 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-21 21:18:44,625 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-21 21:18:44,625 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-21 21:18:44,626 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-21 21:18:44,626 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:44" (1/1) ...
[2024-11-21 21:18:44,634 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-21 21:18:44,642 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-21 21:18:44,655 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-11-21 21:18:44,657 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-11-21 21:18:44,689 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-21 21:18:44,689 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-21 21:18:44,690 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-21 21:18:44,690 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-21 21:18:44,740 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-21 21:18:44,742 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-21 21:18:45,471 INFO  L?                        ?]: Removed 75 outVars from TransFormulas that were not future-live.
[2024-11-21 21:18:45,472 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-21 21:18:45,489 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-21 21:18:45,490 INFO  L316             CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-21 21:18:45,491 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:18:45 BoogieIcfgContainer
[2024-11-21 21:18:45,491 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-21 21:18:45,493 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-21 21:18:45,493 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-21 21:18:45,496 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-21 21:18:45,496 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 09:18:44" (1/3) ...
[2024-11-21 21:18:45,496 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fd03c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:18:45, skipping insertion in model container
[2024-11-21 21:18:45,497 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:18:44" (2/3) ...
[2024-11-21 21:18:45,497 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fd03c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:18:45, skipping insertion in model container
[2024-11-21 21:18:45,497 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:18:45" (3/3) ...
[2024-11-21 21:18:45,498 INFO  L112   eAbstractionObserver]: Analyzing ICFG Problem01_label25.c
[2024-11-21 21:18:45,510 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-21 21:18:45,510 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-21 21:18:45,561 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-21 21:18:45,567 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;@6e451141, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-21 21:18:45,568 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-21 21:18:45,572 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 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-11-21 21:18:45,583 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 120
[2024-11-21 21:18:45,583 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-21 21:18:45,584 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-11-21 21:18:45,584 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-21 21:18:45,588 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-21 21:18:45,589 INFO  L85        PathProgramCache]: Analyzing trace with hash -278930290, now seen corresponding path program 1 times
[2024-11-21 21:18:45,596 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-21 21:18:45,596 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295667158]
[2024-11-21 21:18:45,596 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-21 21:18:45,597 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-21 21:18:45,754 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-21 21:18:46,233 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-21 21:18:46,234 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-21 21:18:46,234 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295667158]
[2024-11-21 21:18:46,235 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295667158] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-21 21:18:46,235 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-21 21:18:46,235 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-21 21:18:46,236 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565965224]
[2024-11-21 21:18:46,237 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-21 21:18:46,241 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-21 21:18:46,241 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-21 21:18:46,260 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-21 21:18:46,260 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-21 21:18:46,263 INFO  L87              Difference]: Start difference. First operand  has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 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 4 states, 4 states have (on average 29.75) internal successors, (119), 3 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-11-21 21:18:47,101 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-21 21:18:47,102 INFO  L93              Difference]: Finished difference Result 662 states and 1178 transitions.
[2024-11-21 21:18:47,103 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-11-21 21:18:47,104 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 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-11-21 21:18:47,105 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-21 21:18:47,115 INFO  L225             Difference]: With dead ends: 662
[2024-11-21 21:18:47,115 INFO  L226             Difference]: Without dead ends: 397
[2024-11-21 21:18:47,120 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-21 21:18:47,123 INFO  L432           NwaCegarLoop]: 65 mSDtfsCounter, 317 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2024-11-21 21:18:47,125 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 81 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2024-11-21 21:18:47,140 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 397 states.
[2024-11-21 21:18:47,162 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397.
[2024-11-21 21:18:47,163 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 397 states, 396 states have (on average 1.3055555555555556) internal successors, (517), 396 states have internal predecessors, (517), 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-11-21 21:18:47,164 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 517 transitions.
[2024-11-21 21:18:47,165 INFO  L78                 Accepts]: Start accepts. Automaton has 397 states and 517 transitions. Word has length 119
[2024-11-21 21:18:47,166 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-21 21:18:47,166 INFO  L471      AbstractCegarLoop]: Abstraction has 397 states and 517 transitions.
[2024-11-21 21:18:47,166 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 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-11-21 21:18:47,166 INFO  L276                IsEmpty]: Start isEmpty. Operand 397 states and 517 transitions.
[2024-11-21 21:18:47,171 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 127
[2024-11-21 21:18:47,171 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-21 21:18:47,171 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-11-21 21:18:47,171 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-21 21:18:47,172 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-21 21:18:47,172 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-21 21:18:47,172 INFO  L85        PathProgramCache]: Analyzing trace with hash -876569957, now seen corresponding path program 1 times
[2024-11-21 21:18:47,172 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-21 21:18:47,173 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237701217]
[2024-11-21 21:18:47,173 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-21 21:18:47,173 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-21 21:18:47,209 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-21 21:18:47,499 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-21 21:18:47,500 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-21 21:18:47,500 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237701217]
[2024-11-21 21:18:47,501 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237701217] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-21 21:18:47,501 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-21 21:18:47,501 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-21 21:18:47,501 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536507443]
[2024-11-21 21:18:47,502 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-21 21:18:47,503 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-21 21:18:47,503 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-21 21:18:47,504 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-21 21:18:47,505 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-21 21:18:47,505 INFO  L87              Difference]: Start difference. First operand 397 states and 517 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-11-21 21:18:48,012 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-21 21:18:48,012 INFO  L93              Difference]: Finished difference Result 887 states and 1235 transitions.
[2024-11-21 21:18:48,012 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-21 21:18:48,013 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-11-21 21:18:48,013 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-21 21:18:48,015 INFO  L225             Difference]: With dead ends: 887
[2024-11-21 21:18:48,015 INFO  L226             Difference]: Without dead ends: 528
[2024-11-21 21:18:48,015 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-11-21 21:18:48,016 INFO  L432           NwaCegarLoop]: 71 mSDtfsCounter, 129 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-21 21:18:48,017 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 81 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-21 21:18:48,017 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 528 states.
[2024-11-21 21:18:48,035 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 397.
[2024-11-21 21:18:48,036 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 397 states, 396 states have (on average 1.196969696969697) internal successors, (474), 396 states have internal predecessors, (474), 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-11-21 21:18:48,037 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 474 transitions.
[2024-11-21 21:18:48,037 INFO  L78                 Accepts]: Start accepts. Automaton has 397 states and 474 transitions. Word has length 126
[2024-11-21 21:18:48,037 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-21 21:18:48,037 INFO  L471      AbstractCegarLoop]: Abstraction has 397 states and 474 transitions.
[2024-11-21 21:18:48,037 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-11-21 21:18:48,038 INFO  L276                IsEmpty]: Start isEmpty. Operand 397 states and 474 transitions.
[2024-11-21 21:18:48,039 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 135
[2024-11-21 21:18:48,039 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-21 21:18:48,039 INFO  L215           NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-21 21:18:48,039 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-21 21:18:48,040 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-21 21:18:48,040 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-21 21:18:48,040 INFO  L85        PathProgramCache]: Analyzing trace with hash 1786741917, now seen corresponding path program 1 times
[2024-11-21 21:18:48,040 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-21 21:18:48,040 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800748572]
[2024-11-21 21:18:48,040 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-21 21:18:48,041 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-21 21:18:48,060 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-21 21:18:48,157 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2024-11-21 21:18:48,157 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-21 21:18:48,157 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800748572]
[2024-11-21 21:18:48,157 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800748572] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-21 21:18:48,158 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-21 21:18:48,158 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-21 21:18:48,158 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419596826]
[2024-11-21 21:18:48,158 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-21 21:18:48,158 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-21 21:18:48,158 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-21 21:18:48,159 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-21 21:18:48,159 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-21 21:18:48,159 INFO  L87              Difference]: Start difference. First operand 397 states and 474 transitions. Second operand  has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 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-11-21 21:18:48,415 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-21 21:18:48,415 INFO  L93              Difference]: Finished difference Result 923 states and 1105 transitions.
[2024-11-21 21:18:48,416 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-21 21:18:48,416 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 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 134
[2024-11-21 21:18:48,416 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-21 21:18:48,417 INFO  L225             Difference]: With dead ends: 923
[2024-11-21 21:18:48,417 INFO  L226             Difference]: Without dead ends: 528
[2024-11-21 21:18:48,418 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-11-21 21:18:48,419 INFO  L432           NwaCegarLoop]: 42 mSDtfsCounter, 125 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-21 21:18:48,419 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 46 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-21 21:18:48,420 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 528 states.
[2024-11-21 21:18:48,430 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528.
[2024-11-21 21:18:48,431 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 528 states, 527 states have (on average 1.1707779886148009) internal successors, (617), 527 states have internal predecessors, (617), 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-11-21 21:18:48,432 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 617 transitions.
[2024-11-21 21:18:48,432 INFO  L78                 Accepts]: Start accepts. Automaton has 528 states and 617 transitions. Word has length 134
[2024-11-21 21:18:48,432 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-21 21:18:48,432 INFO  L471      AbstractCegarLoop]: Abstraction has 528 states and 617 transitions.
[2024-11-21 21:18:48,432 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 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-11-21 21:18:48,432 INFO  L276                IsEmpty]: Start isEmpty. Operand 528 states and 617 transitions.
[2024-11-21 21:18:48,434 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 144
[2024-11-21 21:18:48,434 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-21 21:18:48,434 INFO  L215           NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 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]
[2024-11-21 21:18:48,434 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-21 21:18:48,434 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-21 21:18:48,435 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-21 21:18:48,435 INFO  L85        PathProgramCache]: Analyzing trace with hash -1083646213, now seen corresponding path program 1 times
[2024-11-21 21:18:48,435 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-21 21:18:48,435 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794305818]
[2024-11-21 21:18:48,435 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-21 21:18:48,435 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-21 21:18:48,462 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-21 21:18:48,524 INFO  L134       CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2024-11-21 21:18:48,525 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-21 21:18:48,525 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794305818]
[2024-11-21 21:18:48,525 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794305818] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-21 21:18:48,526 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-21 21:18:48,526 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-21 21:18:48,526 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013737636]
[2024-11-21 21:18:48,526 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-21 21:18:48,526 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-21 21:18:48,527 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-21 21:18:48,527 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-21 21:18:48,527 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-21 21:18:48,527 INFO  L87              Difference]: Start difference. First operand 528 states and 617 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-11-21 21:18:48,811 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-21 21:18:48,811 INFO  L93              Difference]: Finished difference Result 1578 states and 1846 transitions.
[2024-11-21 21:18:48,812 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-21 21:18:48,812 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 143
[2024-11-21 21:18:48,812 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-21 21:18:48,815 INFO  L225             Difference]: With dead ends: 1578
[2024-11-21 21:18:48,815 INFO  L226             Difference]: Without dead ends: 1052
[2024-11-21 21:18:48,818 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-11-21 21:18:48,819 INFO  L432           NwaCegarLoop]: 25 mSDtfsCounter, 130 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-21 21:18:48,821 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 30 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-21 21:18:48,823 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1052 states.
[2024-11-21 21:18:48,835 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 921.
[2024-11-21 21:18:48,836 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 921 states, 920 states have (on average 1.1880434782608695) internal successors, (1093), 920 states have internal predecessors, (1093), 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-11-21 21:18:48,838 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1093 transitions.
[2024-11-21 21:18:48,838 INFO  L78                 Accepts]: Start accepts. Automaton has 921 states and 1093 transitions. Word has length 143
[2024-11-21 21:18:48,838 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-21 21:18:48,838 INFO  L471      AbstractCegarLoop]: Abstraction has 921 states and 1093 transitions.
[2024-11-21 21:18:48,839 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-11-21 21:18:48,839 INFO  L276                IsEmpty]: Start isEmpty. Operand 921 states and 1093 transitions.
[2024-11-21 21:18:48,841 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 169
[2024-11-21 21:18:48,841 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-21 21:18:48,841 INFO  L215           NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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]
[2024-11-21 21:18:48,841 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-21 21:18:48,841 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-21 21:18:48,842 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-21 21:18:48,842 INFO  L85        PathProgramCache]: Analyzing trace with hash -1705683237, now seen corresponding path program 1 times
[2024-11-21 21:18:48,842 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-21 21:18:48,842 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273665219]
[2024-11-21 21:18:48,842 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-21 21:18:48,843 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-21 21:18:48,884 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-21 21:18:49,018 INFO  L134       CoverageAnalysis]: Checked inductivity of 94 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2024-11-21 21:18:49,018 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-21 21:18:49,018 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273665219]
[2024-11-21 21:18:49,018 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273665219] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-21 21:18:49,019 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-21 21:18:49,019 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-21 21:18:49,020 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342185488]
[2024-11-21 21:18:49,020 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-21 21:18:49,020 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-21 21:18:49,020 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-21 21:18:49,021 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-21 21:18:49,022 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-21 21:18:49,022 INFO  L87              Difference]: Start difference. First operand 921 states and 1093 transitions. Second operand  has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 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-11-21 21:18:49,461 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-21 21:18:49,462 INFO  L93              Difference]: Finished difference Result 2364 states and 2853 transitions.
[2024-11-21 21:18:49,462 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-21 21:18:49,462 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 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 168
[2024-11-21 21:18:49,463 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-21 21:18:49,466 INFO  L225             Difference]: With dead ends: 2364
[2024-11-21 21:18:49,466 INFO  L226             Difference]: Without dead ends: 1445
[2024-11-21 21:18:49,467 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-11-21 21:18:49,468 INFO  L432           NwaCegarLoop]: 27 mSDtfsCounter, 258 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-21 21:18:49,468 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 35 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-21 21:18:49,469 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1445 states.
[2024-11-21 21:18:49,478 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1052.
[2024-11-21 21:18:49,479 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1052 states, 1051 states have (on average 1.1722169362511894) internal successors, (1232), 1051 states have internal predecessors, (1232), 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-11-21 21:18:49,481 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1232 transitions.
[2024-11-21 21:18:49,481 INFO  L78                 Accepts]: Start accepts. Automaton has 1052 states and 1232 transitions. Word has length 168
[2024-11-21 21:18:49,481 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-21 21:18:49,481 INFO  L471      AbstractCegarLoop]: Abstraction has 1052 states and 1232 transitions.
[2024-11-21 21:18:49,482 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 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-11-21 21:18:49,482 INFO  L276                IsEmpty]: Start isEmpty. Operand 1052 states and 1232 transitions.
[2024-11-21 21:18:49,483 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 183
[2024-11-21 21:18:49,484 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-21 21:18:49,484 INFO  L215           NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-21 21:18:49,484 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-21 21:18:49,484 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-21 21:18:49,484 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-21 21:18:49,485 INFO  L85        PathProgramCache]: Analyzing trace with hash 130602462, now seen corresponding path program 1 times
[2024-11-21 21:18:49,485 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-21 21:18:49,485 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258119980]
[2024-11-21 21:18:49,485 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-21 21:18:49,485 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-21 21:18:49,507 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-21 21:18:49,692 INFO  L134       CoverageAnalysis]: Checked inductivity of 112 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked.
[2024-11-21 21:18:49,693 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-21 21:18:49,693 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258119980]
[2024-11-21 21:18:49,693 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258119980] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-21 21:18:49,693 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-21 21:18:49,693 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-21 21:18:49,694 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602459196]
[2024-11-21 21:18:49,694 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-21 21:18:49,695 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-21 21:18:49,695 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-21 21:18:49,695 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-21 21:18:49,695 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-21 21:18:49,695 INFO  L87              Difference]: Start difference. First operand 1052 states and 1232 transitions. Second operand  has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 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-11-21 21:18:50,115 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-21 21:18:50,116 INFO  L93              Difference]: Finished difference Result 2626 states and 3090 transitions.
[2024-11-21 21:18:50,116 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-21 21:18:50,116 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 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 182
[2024-11-21 21:18:50,117 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-21 21:18:50,122 INFO  L225             Difference]: With dead ends: 2626
[2024-11-21 21:18:50,122 INFO  L226             Difference]: Without dead ends: 1576
[2024-11-21 21:18:50,123 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-11-21 21:18:50,125 INFO  L432           NwaCegarLoop]: 35 mSDtfsCounter, 346 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-21 21:18:50,126 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 43 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-21 21:18:50,128 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1576 states.
[2024-11-21 21:18:50,140 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1445.
[2024-11-21 21:18:50,141 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1445 states, 1444 states have (on average 1.164819944598338) internal successors, (1682), 1444 states have internal predecessors, (1682), 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-11-21 21:18:50,143 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1682 transitions.
[2024-11-21 21:18:50,145 INFO  L78                 Accepts]: Start accepts. Automaton has 1445 states and 1682 transitions. Word has length 182
[2024-11-21 21:18:50,146 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-21 21:18:50,146 INFO  L471      AbstractCegarLoop]: Abstraction has 1445 states and 1682 transitions.
[2024-11-21 21:18:50,146 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 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-11-21 21:18:50,146 INFO  L276                IsEmpty]: Start isEmpty. Operand 1445 states and 1682 transitions.
[2024-11-21 21:18:50,148 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 225
[2024-11-21 21:18:50,149 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-21 21:18:50,149 INFO  L215           NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-21 21:18:50,149 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-21 21:18:50,149 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-21 21:18:50,149 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-21 21:18:50,150 INFO  L85        PathProgramCache]: Analyzing trace with hash 1762338717, now seen corresponding path program 1 times
[2024-11-21 21:18:50,150 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-21 21:18:50,150 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131183643]
[2024-11-21 21:18:50,150 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-21 21:18:50,150 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-21 21:18:50,174 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-21 21:18:50,325 INFO  L134       CoverageAnalysis]: Checked inductivity of 212 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked.
[2024-11-21 21:18:50,325 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-21 21:18:50,325 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131183643]
[2024-11-21 21:18:50,325 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131183643] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-21 21:18:50,325 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-21 21:18:50,325 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-21 21:18:50,325 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131986848]
[2024-11-21 21:18:50,325 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-21 21:18:50,326 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-21 21:18:50,326 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-21 21:18:50,326 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-21 21:18:50,326 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-21 21:18:50,326 INFO  L87              Difference]: Start difference. First operand 1445 states and 1682 transitions. Second operand  has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 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-11-21 21:18:50,797 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-21 21:18:50,797 INFO  L93              Difference]: Finished difference Result 3281 states and 3801 transitions.
[2024-11-21 21:18:50,798 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-21 21:18:50,798 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 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 224
[2024-11-21 21:18:50,798 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-21 21:18:50,802 INFO  L225             Difference]: With dead ends: 3281
[2024-11-21 21:18:50,802 INFO  L226             Difference]: Without dead ends: 1838
[2024-11-21 21:18:50,803 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-11-21 21:18:50,804 INFO  L432           NwaCegarLoop]: 23 mSDtfsCounter, 222 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-21 21:18:50,804 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 33 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-21 21:18:50,808 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1838 states.
[2024-11-21 21:18:50,822 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1576.
[2024-11-21 21:18:50,824 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1576 states, 1575 states have (on average 1.1498412698412699) internal successors, (1811), 1575 states have internal predecessors, (1811), 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-11-21 21:18:50,826 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1811 transitions.
[2024-11-21 21:18:50,826 INFO  L78                 Accepts]: Start accepts. Automaton has 1576 states and 1811 transitions. Word has length 224
[2024-11-21 21:18:50,827 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-21 21:18:50,827 INFO  L471      AbstractCegarLoop]: Abstraction has 1576 states and 1811 transitions.
[2024-11-21 21:18:50,828 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 45.5) internal successors, (182), 4 states have internal predecessors, (182), 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-11-21 21:18:50,828 INFO  L276                IsEmpty]: Start isEmpty. Operand 1576 states and 1811 transitions.
[2024-11-21 21:18:50,831 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 268
[2024-11-21 21:18:50,831 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-21 21:18:50,831 INFO  L215           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2024-11-21 21:18:50,831 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-21 21:18:50,831 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-21 21:18:50,832 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-21 21:18:50,832 INFO  L85        PathProgramCache]: Analyzing trace with hash -1503446723, now seen corresponding path program 1 times
[2024-11-21 21:18:50,832 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-21 21:18:50,832 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467618326]
[2024-11-21 21:18:50,832 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-21 21:18:50,833 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-21 21:18:50,871 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-21 21:18:50,957 INFO  L134       CoverageAnalysis]: Checked inductivity of 375 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked.
[2024-11-21 21:18:50,957 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-21 21:18:50,957 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467618326]
[2024-11-21 21:18:50,957 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467618326] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-21 21:18:50,958 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-21 21:18:50,958 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-21 21:18:50,958 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654335854]
[2024-11-21 21:18:50,958 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-21 21:18:50,958 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-21 21:18:50,958 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-21 21:18:50,958 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-21 21:18:50,959 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-21 21:18:50,959 INFO  L87              Difference]: Start difference. First operand 1576 states and 1811 transitions. Second operand  has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 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-11-21 21:18:51,240 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-21 21:18:51,240 INFO  L93              Difference]: Finished difference Result 3412 states and 3893 transitions.
[2024-11-21 21:18:51,240 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-21 21:18:51,240 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 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 267
[2024-11-21 21:18:51,241 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-21 21:18:51,244 INFO  L225             Difference]: With dead ends: 3412
[2024-11-21 21:18:51,245 INFO  L226             Difference]: Without dead ends: 1838
[2024-11-21 21:18:51,246 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-11-21 21:18:51,248 INFO  L432           NwaCegarLoop]: 173 mSDtfsCounter, 88 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-21 21:18:51,248 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 178 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-21 21:18:51,251 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1838 states.
[2024-11-21 21:18:51,264 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707.
[2024-11-21 21:18:51,266 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1707 states, 1706 states have (on average 1.1201641266119577) internal successors, (1911), 1706 states have internal predecessors, (1911), 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-11-21 21:18:51,268 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1911 transitions.
[2024-11-21 21:18:51,269 INFO  L78                 Accepts]: Start accepts. Automaton has 1707 states and 1911 transitions. Word has length 267
[2024-11-21 21:18:51,269 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-21 21:18:51,269 INFO  L471      AbstractCegarLoop]: Abstraction has 1707 states and 1911 transitions.
[2024-11-21 21:18:51,269 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 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-11-21 21:18:51,269 INFO  L276                IsEmpty]: Start isEmpty. Operand 1707 states and 1911 transitions.
[2024-11-21 21:18:51,272 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 290
[2024-11-21 21:18:51,272 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-21 21:18:51,272 INFO  L215           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2024-11-21 21:18:51,273 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-21 21:18:51,273 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-21 21:18:51,273 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-21 21:18:51,273 INFO  L85        PathProgramCache]: Analyzing trace with hash 534666374, now seen corresponding path program 1 times
[2024-11-21 21:18:51,273 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-21 21:18:51,273 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341030404]
[2024-11-21 21:18:51,273 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-21 21:18:51,274 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-21 21:18:51,330 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-21 21:18:51,685 INFO  L134       CoverageAnalysis]: Checked inductivity of 407 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked.
[2024-11-21 21:18:51,686 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-21 21:18:51,686 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341030404]
[2024-11-21 21:18:51,686 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341030404] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-21 21:18:51,686 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-21 21:18:51,686 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-21 21:18:51,686 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129112980]
[2024-11-21 21:18:51,686 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-21 21:18:51,686 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-21 21:18:51,686 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-21 21:18:51,687 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-21 21:18:51,687 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-21 21:18:51,687 INFO  L87              Difference]: Start difference. First operand 1707 states and 1911 transitions. Second operand  has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 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-11-21 21:18:52,128 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-21 21:18:52,128 INFO  L93              Difference]: Finished difference Result 3543 states and 3954 transitions.
[2024-11-21 21:18:52,128 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-21 21:18:52,129 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 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 289
[2024-11-21 21:18:52,129 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-21 21:18:52,133 INFO  L225             Difference]: With dead ends: 3543
[2024-11-21 21:18:52,133 INFO  L226             Difference]: Without dead ends: 1838
[2024-11-21 21:18:52,134 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-11-21 21:18:52,135 INFO  L432           NwaCegarLoop]: 35 mSDtfsCounter, 226 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-21 21:18:52,135 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 48 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-21 21:18:52,136 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1838 states.
[2024-11-21 21:18:52,151 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707.
[2024-11-21 21:18:52,152 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1707 states, 1706 states have (on average 1.100234466588511) internal successors, (1877), 1706 states have internal predecessors, (1877), 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-11-21 21:18:52,154 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1877 transitions.
[2024-11-21 21:18:52,155 INFO  L78                 Accepts]: Start accepts. Automaton has 1707 states and 1877 transitions. Word has length 289
[2024-11-21 21:18:52,155 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-21 21:18:52,155 INFO  L471      AbstractCegarLoop]: Abstraction has 1707 states and 1877 transitions.
[2024-11-21 21:18:52,155 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 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-11-21 21:18:52,155 INFO  L276                IsEmpty]: Start isEmpty. Operand 1707 states and 1877 transitions.
[2024-11-21 21:18:52,158 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 310
[2024-11-21 21:18:52,158 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-21 21:18:52,159 INFO  L215           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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]
[2024-11-21 21:18:52,159 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-21 21:18:52,159 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-21 21:18:52,159 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-21 21:18:52,159 INFO  L85        PathProgramCache]: Analyzing trace with hash -427431724, now seen corresponding path program 1 times
[2024-11-21 21:18:52,159 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-21 21:18:52,159 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997469336]
[2024-11-21 21:18:52,160 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-21 21:18:52,160 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-21 21:18:52,203 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-21 21:18:52,329 INFO  L134       CoverageAnalysis]: Checked inductivity of 467 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked.
[2024-11-21 21:18:52,330 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-21 21:18:52,330 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997469336]
[2024-11-21 21:18:52,330 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997469336] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-21 21:18:52,330 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-21 21:18:52,330 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-21 21:18:52,330 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767165521]
[2024-11-21 21:18:52,330 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-21 21:18:52,331 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-21 21:18:52,331 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-21 21:18:52,331 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-21 21:18:52,331 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-21 21:18:52,331 INFO  L87              Difference]: Start difference. First operand 1707 states and 1877 transitions. Second operand  has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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-11-21 21:18:52,608 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-21 21:18:52,609 INFO  L93              Difference]: Finished difference Result 3803 states and 4172 transitions.
[2024-11-21 21:18:52,609 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-21 21:18:52,609 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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 309
[2024-11-21 21:18:52,609 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-21 21:18:52,610 INFO  L225             Difference]: With dead ends: 3803
[2024-11-21 21:18:52,610 INFO  L226             Difference]: Without dead ends: 0
[2024-11-21 21:18:52,612 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-11-21 21:18:52,612 INFO  L432           NwaCegarLoop]: 165 mSDtfsCounter, 20 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-21 21:18:52,613 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 170 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-21 21:18:52,613 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2024-11-21 21:18:52,613 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2024-11-21 21:18:52,613 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-11-21 21:18:52,613 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2024-11-21 21:18:52,614 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 309
[2024-11-21 21:18:52,614 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-21 21:18:52,614 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2024-11-21 21:18:52,614 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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-11-21 21:18:52,614 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2024-11-21 21:18:52,614 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2024-11-21 21:18:52,617 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-21 21:18:52,617 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-21 21:18:52,620 INFO  L407         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-21 21:18:52,622 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2024-11-21 21:18:52,877 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2024-11-21 21:18:52,893 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 09:18:52 BoogieIcfgContainer
[2024-11-21 21:18:52,893 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-21 21:18:52,894 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-21 21:18:52,894 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-11-21 21:18:52,894 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-11-21 21:18:52,894 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:18:45" (3/4) ...
[2024-11-21 21:18:52,896 INFO  L142         WitnessPrinter]: Generating witness for correct program
[2024-11-21 21:18:52,908 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges
[2024-11-21 21:18:52,912 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2024-11-21 21:18:52,913 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2024-11-21 21:18:52,913 INFO  L925   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2024-11-21 21:18:53,026 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-21 21:18:53,026 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2024-11-21 21:18:53,026 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-21 21:18:53,027 INFO  L158              Benchmark]: Toolchain (without parser) took 8969.52ms. Allocated memory was 157.3MB in the beginning and 343.9MB in the end (delta: 186.6MB). Free memory was 99.2MB in the beginning and 276.7MB in the end (delta: -177.5MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB.
[2024-11-21 21:18:53,027 INFO  L158              Benchmark]: CDTParser took 0.14ms. Allocated memory is still 157.3MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-21 21:18:53,027 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 445.30ms. Allocated memory is still 157.3MB. Free memory was 99.2MB in the beginning and 69.1MB in the end (delta: 30.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB.
[2024-11-21 21:18:53,027 INFO  L158              Benchmark]: Boogie Procedure Inliner took 56.37ms. Allocated memory is still 157.3MB. Free memory was 69.1MB in the beginning and 63.5MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
[2024-11-21 21:18:53,027 INFO  L158              Benchmark]: Boogie Preprocessor took 64.12ms. Allocated memory is still 157.3MB. Free memory was 63.5MB in the beginning and 57.9MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-21 21:18:53,028 INFO  L158              Benchmark]: RCFGBuilder took 866.15ms. Allocated memory was 157.3MB in the beginning and 237.0MB in the end (delta: 79.7MB). Free memory was 57.9MB in the beginning and 137.9MB in the end (delta: -80.0MB). Peak memory consumption was 39.6MB. Max. memory is 16.1GB.
[2024-11-21 21:18:53,028 INFO  L158              Benchmark]: TraceAbstraction took 7400.08ms. Allocated memory was 237.0MB in the beginning and 343.9MB in the end (delta: 107.0MB). Free memory was 136.9MB in the beginning and 288.2MB in the end (delta: -151.4MB). Peak memory consumption was 138.0MB. Max. memory is 16.1GB.
[2024-11-21 21:18:53,028 INFO  L158              Benchmark]: Witness Printer took 132.77ms. Allocated memory is still 343.9MB. Free memory was 288.2MB in the beginning and 276.7MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
[2024-11-21 21:18:53,033 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.14ms. Allocated memory is still 157.3MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 445.30ms. Allocated memory is still 157.3MB. Free memory was 99.2MB in the beginning and 69.1MB in the end (delta: 30.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 56.37ms. Allocated memory is still 157.3MB. Free memory was 69.1MB in the beginning and 63.5MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 64.12ms. Allocated memory is still 157.3MB. Free memory was 63.5MB in the beginning and 57.9MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * RCFGBuilder took 866.15ms. Allocated memory was 157.3MB in the beginning and 237.0MB in the end (delta: 79.7MB). Free memory was 57.9MB in the beginning and 137.9MB in the end (delta: -80.0MB). Peak memory consumption was 39.6MB. Max. memory is 16.1GB.
 * TraceAbstraction took 7400.08ms. Allocated memory was 237.0MB in the beginning and 343.9MB in the end (delta: 107.0MB). Free memory was 136.9MB in the beginning and 288.2MB in the end (delta: -151.4MB). Peak memory consumption was 138.0MB. Max. memory is 16.1GB.
 * Witness Printer took 132.77ms. Allocated memory is still 343.9MB. Free memory was 288.2MB in the beginning and 276.7MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. 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: 543]: 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, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 10, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1861 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1861 mSDsluCounter, 745 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 84 mSDsCounter, 835 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4571 IncrementalHoareTripleChecker+Invalid, 5406 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 835 mSolverCounterUnsat, 661 mSDtfsCounter, 4571 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1707occurred in iteration=8, InterpolantAutomatonStates: 37, 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, 1310 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1961 NumberOfCodeBlocks, 1961 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1951 ConstructedInterpolants, 0 QuantifiedInterpolants, 7023 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 1728/1728 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) && (a16 <= 5)) || ((a8 <= 13) && (a20 == 1))) || ((a7 != 1) && (a21 == 1))) || (((a8 <= 13) && (a17 == 1)) && (a16 <= 5)))
RESULT: Ultimate proved your program to be correct!
[2024-11-21 21:18:53,054 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

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