./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4_overflow.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version 84cfde4a
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4_overflow.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 a476129b1600ab93482417c4ebe15d373b743970a04c4bdd8ca1478cbccf2de7
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-84cfde4
[2024-10-11 03:19:29,310 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-10-11 03:19:29,365 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-10-11 03:19:29,370 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-10-11 03:19:29,371 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-10-11 03:19:29,402 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-10-11 03:19:29,403 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-10-11 03:19:29,403 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-10-11 03:19:29,403 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-10-11 03:19:29,404 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-10-11 03:19:29,404 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-10-11 03:19:29,404 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-10-11 03:19:29,405 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-10-11 03:19:29,405 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-10-11 03:19:29,405 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-10-11 03:19:29,405 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-10-11 03:19:29,406 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-10-11 03:19:29,406 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-10-11 03:19:29,406 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-10-11 03:19:29,406 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-10-11 03:19:29,407 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-10-11 03:19:29,407 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-10-11 03:19:29,407 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-10-11 03:19:29,408 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-10-11 03:19:29,408 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-10-11 03:19:29,408 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-10-11 03:19:29,408 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-10-11 03:19:29,408 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-10-11 03:19:29,409 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-10-11 03:19:29,409 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-10-11 03:19:29,409 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-10-11 03:19:29,409 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-10-11 03:19:29,409 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-11 03:19:29,410 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-10-11 03:19:29,410 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-10-11 03:19:29,410 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-10-11 03:19:29,410 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-10-11 03:19:29,411 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-10-11 03:19:29,411 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-10-11 03:19:29,411 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-10-11 03:19:29,411 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-10-11 03:19:29,415 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-10-11 03:19:29,415 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-clean/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-clean/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 -> a476129b1600ab93482417c4ebe15d373b743970a04c4bdd8ca1478cbccf2de7
[2024-10-11 03:19:29,680 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-10-11 03:19:29,737 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-10-11 03:19:29,746 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-10-11 03:19:29,747 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-10-11 03:19:29,754 INFO  L274        PluginConnector]: CDTParser initialized
[2024-10-11 03:19:29,755 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4_overflow.ufo.UNBOUNDED.pals.c
[2024-10-11 03:19:31,107 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-10-11 03:19:31,309 INFO  L384              CDTParser]: Found 1 translation units.
[2024-10-11 03:19:31,310 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4_overflow.ufo.UNBOUNDED.pals.c
[2024-10-11 03:19:31,323 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/90ba799c5/da984b6bba214f4ab725c2da19fad890/FLAG67b7661c3
[2024-10-11 03:19:31,335 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/90ba799c5/da984b6bba214f4ab725c2da19fad890
[2024-10-11 03:19:31,337 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-10-11 03:19:31,339 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-10-11 03:19:31,340 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-10-11 03:19:31,340 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-10-11 03:19:31,344 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-10-11 03:19:31,345 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:19:31" (1/1) ...
[2024-10-11 03:19:31,348 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50748a77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:31, skipping insertion in model container
[2024-10-11 03:19:31,348 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:19:31" (1/1) ...
[2024-10-11 03:19:31,389 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-10-11 03:19:31,846 WARN  L248   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4_overflow.ufo.UNBOUNDED.pals.c[28307,28320]
[2024-10-11 03:19:31,850 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-10-11 03:19:31,870 INFO  L200         MainTranslator]: Completed pre-run
[2024-10-11 03:19:31,940 WARN  L248   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4_overflow.ufo.UNBOUNDED.pals.c[28307,28320]
[2024-10-11 03:19:31,941 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-10-11 03:19:31,966 INFO  L204         MainTranslator]: Completed translation
[2024-10-11 03:19:31,966 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:31 WrapperNode
[2024-10-11 03:19:31,966 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-10-11 03:19:31,967 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-10-11 03:19:31,967 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-10-11 03:19:31,971 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-10-11 03:19:31,977 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:31" (1/1) ...
[2024-10-11 03:19:31,989 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:31" (1/1) ...
[2024-10-11 03:19:32,032 INFO  L138                Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 951
[2024-10-11 03:19:32,032 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-10-11 03:19:32,033 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-10-11 03:19:32,037 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-10-11 03:19:32,037 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-10-11 03:19:32,046 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:31" (1/1) ...
[2024-10-11 03:19:32,047 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:31" (1/1) ...
[2024-10-11 03:19:32,055 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:31" (1/1) ...
[2024-10-11 03:19:32,072 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-10-11 03:19:32,072 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:31" (1/1) ...
[2024-10-11 03:19:32,072 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:31" (1/1) ...
[2024-10-11 03:19:32,084 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:31" (1/1) ...
[2024-10-11 03:19:32,101 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:31" (1/1) ...
[2024-10-11 03:19:32,107 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:31" (1/1) ...
[2024-10-11 03:19:32,113 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:31" (1/1) ...
[2024-10-11 03:19:32,127 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-10-11 03:19:32,128 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-10-11 03:19:32,128 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-10-11 03:19:32,128 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-10-11 03:19:32,129 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:31" (1/1) ...
[2024-10-11 03:19:32,141 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-11 03:19:32,154 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3
[2024-10-11 03:19:32,173 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-10-11 03:19:32,176 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-10-11 03:19:32,235 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-10-11 03:19:32,235 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-10-11 03:19:32,235 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-10-11 03:19:32,235 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-10-11 03:19:32,387 INFO  L238             CfgBuilder]: Building ICFG
[2024-10-11 03:19:32,389 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-10-11 03:19:33,256 INFO  L?                        ?]: Removed 111 outVars from TransFormulas that were not future-live.
[2024-10-11 03:19:33,256 INFO  L287             CfgBuilder]: Performing block encoding
[2024-10-11 03:19:33,310 INFO  L309             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-10-11 03:19:33,310 INFO  L314             CfgBuilder]: Removed 1 assume(true) statements.
[2024-10-11 03:19:33,311 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:19:33 BoogieIcfgContainer
[2024-10-11 03:19:33,311 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-10-11 03:19:33,315 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-10-11 03:19:33,315 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-10-11 03:19:33,317 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-10-11 03:19:33,318 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:19:31" (1/3) ...
[2024-10-11 03:19:33,319 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@741cfed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:19:33, skipping insertion in model container
[2024-10-11 03:19:33,319 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:19:31" (2/3) ...
[2024-10-11 03:19:33,320 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@741cfed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:19:33, skipping insertion in model container
[2024-10-11 03:19:33,320 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:19:33" (3/3) ...
[2024-10-11 03:19:33,323 INFO  L112   eAbstractionObserver]: Analyzing ICFG pals_floodmax.4_overflow.ufo.UNBOUNDED.pals.c
[2024-10-11 03:19:33,344 INFO  L209   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-10-11 03:19:33,345 INFO  L149   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-10-11 03:19:33,405 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-10-11 03:19:33,411 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;@17ba5c34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-10-11 03:19:33,411 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-10-11 03:19:33,421 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 275 states, 273 states have (on average 1.84981684981685) internal successors, (505), 274 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:33,432 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 75
[2024-10-11 03:19:33,435 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-11 03:19:33,436 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]
[2024-10-11 03:19:33,436 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-11 03:19:33,441 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-11 03:19:33,441 INFO  L85        PathProgramCache]: Analyzing trace with hash -1890370261, now seen corresponding path program 1 times
[2024-10-11 03:19:33,448 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-11 03:19:33,449 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250213414]
[2024-10-11 03:19:33,449 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-11 03:19:33,450 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-11 03:19:33,728 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 03:19:33,883 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-11 03:19:33,884 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-11 03:19:33,884 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250213414]
[2024-10-11 03:19:33,885 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250213414] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-11 03:19:33,885 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-11 03:19:33,885 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-11 03:19:33,886 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275843043]
[2024-10-11 03:19:33,887 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-11 03:19:33,892 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-10-11 03:19:33,892 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-11 03:19:33,917 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-10-11 03:19:33,918 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-10-11 03:19:33,920 INFO  L87              Difference]: Start difference. First operand  has 275 states, 273 states have (on average 1.84981684981685) internal successors, (505), 274 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:34,002 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-11 03:19:34,002 INFO  L93              Difference]: Finished difference Result 359 states and 657 transitions.
[2024-10-11 03:19:34,006 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-10-11 03:19:34,008 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 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 74
[2024-10-11 03:19:34,008 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-11 03:19:34,021 INFO  L225             Difference]: With dead ends: 359
[2024-10-11 03:19:34,021 INFO  L226             Difference]: Without dead ends: 273
[2024-10-11 03:19:34,024 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-10-11 03:19:34,029 INFO  L432           NwaCegarLoop]: 497 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-11 03:19:34,030 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 497 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-11 03:19:34,046 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 273 states.
[2024-10-11 03:19:34,075 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273.
[2024-10-11 03:19:34,079 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 273 states, 272 states have (on average 1.838235294117647) internal successors, (500), 272 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:34,082 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 500 transitions.
[2024-10-11 03:19:34,086 INFO  L78                 Accepts]: Start accepts. Automaton has 273 states and 500 transitions. Word has length 74
[2024-10-11 03:19:34,086 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-11 03:19:34,086 INFO  L471      AbstractCegarLoop]: Abstraction has 273 states and 500 transitions.
[2024-10-11 03:19:34,125 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:34,126 INFO  L276                IsEmpty]: Start isEmpty. Operand 273 states and 500 transitions.
[2024-10-11 03:19:34,131 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 75
[2024-10-11 03:19:34,131 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-11 03:19:34,131 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]
[2024-10-11 03:19:34,132 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-10-11 03:19:34,132 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-11 03:19:34,133 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-11 03:19:34,134 INFO  L85        PathProgramCache]: Analyzing trace with hash 599158701, now seen corresponding path program 1 times
[2024-10-11 03:19:34,134 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-11 03:19:34,134 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324396971]
[2024-10-11 03:19:34,134 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-11 03:19:34,135 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-11 03:19:34,213 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 03:19:34,423 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-11 03:19:34,424 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-11 03:19:34,424 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324396971]
[2024-10-11 03:19:34,424 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324396971] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-11 03:19:34,424 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-11 03:19:34,424 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-10-11 03:19:34,424 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749569760]
[2024-10-11 03:19:34,425 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-11 03:19:34,426 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-10-11 03:19:34,427 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-11 03:19:34,428 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-10-11 03:19:34,428 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-10-11 03:19:34,428 INFO  L87              Difference]: Start difference. First operand 273 states and 500 transitions. Second operand  has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:34,535 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-11 03:19:34,535 INFO  L93              Difference]: Finished difference Result 359 states and 651 transitions.
[2024-10-11 03:19:34,535 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-10-11 03:19:34,536 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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 74
[2024-10-11 03:19:34,536 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-11 03:19:34,537 INFO  L225             Difference]: With dead ends: 359
[2024-10-11 03:19:34,538 INFO  L226             Difference]: Without dead ends: 273
[2024-10-11 03:19:34,538 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-10-11 03:19:34,539 INFO  L432           NwaCegarLoop]: 497 mSDtfsCounter, 0 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1446 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-11 03:19:34,539 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1446 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-11 03:19:34,540 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 273 states.
[2024-10-11 03:19:34,549 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273.
[2024-10-11 03:19:34,550 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 273 states, 272 states have (on average 1.6838235294117647) internal successors, (458), 272 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:34,550 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 458 transitions.
[2024-10-11 03:19:34,551 INFO  L78                 Accepts]: Start accepts. Automaton has 273 states and 458 transitions. Word has length 74
[2024-10-11 03:19:34,551 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-11 03:19:34,551 INFO  L471      AbstractCegarLoop]: Abstraction has 273 states and 458 transitions.
[2024-10-11 03:19:34,551 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:34,551 INFO  L276                IsEmpty]: Start isEmpty. Operand 273 states and 458 transitions.
[2024-10-11 03:19:34,554 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 116
[2024-10-11 03:19:34,554 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-11 03:19:34,554 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]
[2024-10-11 03:19:34,554 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-10-11 03:19:34,555 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-11 03:19:34,555 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-11 03:19:34,555 INFO  L85        PathProgramCache]: Analyzing trace with hash -1162766459, now seen corresponding path program 1 times
[2024-10-11 03:19:34,555 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-11 03:19:34,556 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073671239]
[2024-10-11 03:19:34,556 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-11 03:19:34,556 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-11 03:19:34,636 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 03:19:34,769 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-11 03:19:34,769 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-11 03:19:34,770 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073671239]
[2024-10-11 03:19:34,770 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073671239] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-11 03:19:34,773 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-11 03:19:34,773 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-11 03:19:34,773 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20222511]
[2024-10-11 03:19:34,773 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-11 03:19:34,774 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-11 03:19:34,774 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-11 03:19:34,775 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-11 03:19:34,775 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-11 03:19:34,775 INFO  L87              Difference]: Start difference. First operand 273 states and 458 transitions. Second operand  has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:34,836 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-11 03:19:34,837 INFO  L93              Difference]: Finished difference Result 428 states and 733 transitions.
[2024-10-11 03:19:34,837 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-11 03:19:34,838 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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 115
[2024-10-11 03:19:34,838 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-11 03:19:34,842 INFO  L225             Difference]: With dead ends: 428
[2024-10-11 03:19:34,842 INFO  L226             Difference]: Without dead ends: 345
[2024-10-11 03:19:34,842 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-11 03:19:34,845 INFO  L432           NwaCegarLoop]: 559 mSDtfsCounter, 119 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-11 03:19:34,846 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 967 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-11 03:19:34,847 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 345 states.
[2024-10-11 03:19:34,861 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343.
[2024-10-11 03:19:34,861 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 343 states, 342 states have (on average 1.6929824561403508) internal successors, (579), 342 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:34,862 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 579 transitions.
[2024-10-11 03:19:34,863 INFO  L78                 Accepts]: Start accepts. Automaton has 343 states and 579 transitions. Word has length 115
[2024-10-11 03:19:34,863 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-11 03:19:34,863 INFO  L471      AbstractCegarLoop]: Abstraction has 343 states and 579 transitions.
[2024-10-11 03:19:34,864 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:34,864 INFO  L276                IsEmpty]: Start isEmpty. Operand 343 states and 579 transitions.
[2024-10-11 03:19:34,867 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 119
[2024-10-11 03:19:34,867 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-11 03:19:34,867 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]
[2024-10-11 03:19:34,868 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-10-11 03:19:34,868 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-11 03:19:34,868 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-11 03:19:34,869 INFO  L85        PathProgramCache]: Analyzing trace with hash -1368270817, now seen corresponding path program 1 times
[2024-10-11 03:19:34,869 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-11 03:19:34,869 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851859961]
[2024-10-11 03:19:34,869 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-11 03:19:34,869 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-11 03:19:34,924 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 03:19:35,068 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-11 03:19:35,068 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-11 03:19:35,068 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851859961]
[2024-10-11 03:19:35,068 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851859961] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-11 03:19:35,069 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-11 03:19:35,069 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-11 03:19:35,069 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606587550]
[2024-10-11 03:19:35,069 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-11 03:19:35,069 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-11 03:19:35,070 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-11 03:19:35,071 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-11 03:19:35,071 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-11 03:19:35,072 INFO  L87              Difference]: Start difference. First operand 343 states and 579 transitions. Second operand  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:35,133 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-11 03:19:35,133 INFO  L93              Difference]: Finished difference Result 497 states and 852 transitions.
[2024-10-11 03:19:35,134 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-11 03:19:35,134 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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 118
[2024-10-11 03:19:35,136 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-11 03:19:35,138 INFO  L225             Difference]: With dead ends: 497
[2024-10-11 03:19:35,138 INFO  L226             Difference]: Without dead ends: 414
[2024-10-11 03:19:35,139 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-11 03:19:35,140 INFO  L432           NwaCegarLoop]: 564 mSDtfsCounter, 128 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-11 03:19:35,140 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1001 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-11 03:19:35,141 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 414 states.
[2024-10-11 03:19:35,150 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 412.
[2024-10-11 03:19:35,151 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 412 states, 411 states have (on average 1.705596107055961) internal successors, (701), 411 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:35,152 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 701 transitions.
[2024-10-11 03:19:35,152 INFO  L78                 Accepts]: Start accepts. Automaton has 412 states and 701 transitions. Word has length 118
[2024-10-11 03:19:35,152 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-11 03:19:35,152 INFO  L471      AbstractCegarLoop]: Abstraction has 412 states and 701 transitions.
[2024-10-11 03:19:35,153 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:35,153 INFO  L276                IsEmpty]: Start isEmpty. Operand 412 states and 701 transitions.
[2024-10-11 03:19:35,155 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 119
[2024-10-11 03:19:35,155 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-11 03:19:35,155 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]
[2024-10-11 03:19:35,156 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-10-11 03:19:35,156 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-11 03:19:35,156 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-11 03:19:35,156 INFO  L85        PathProgramCache]: Analyzing trace with hash 2027226664, now seen corresponding path program 1 times
[2024-10-11 03:19:35,156 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-11 03:19:35,157 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858803596]
[2024-10-11 03:19:35,157 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-11 03:19:35,157 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-11 03:19:35,200 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 03:19:35,306 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-11 03:19:35,307 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-11 03:19:35,307 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858803596]
[2024-10-11 03:19:35,307 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858803596] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-11 03:19:35,307 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-11 03:19:35,307 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-11 03:19:35,307 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945661524]
[2024-10-11 03:19:35,307 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-11 03:19:35,308 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-11 03:19:35,308 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-11 03:19:35,308 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-11 03:19:35,309 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-11 03:19:35,309 INFO  L87              Difference]: Start difference. First operand 412 states and 701 transitions. Second operand  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:35,346 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-11 03:19:35,346 INFO  L93              Difference]: Finished difference Result 825 states and 1428 transitions.
[2024-10-11 03:19:35,347 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-11 03:19:35,347 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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 118
[2024-10-11 03:19:35,347 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-11 03:19:35,349 INFO  L225             Difference]: With dead ends: 825
[2024-10-11 03:19:35,349 INFO  L226             Difference]: Without dead ends: 605
[2024-10-11 03:19:35,350 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-11 03:19:35,351 INFO  L432           NwaCegarLoop]: 561 mSDtfsCounter, 120 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-11 03:19:35,351 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 978 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-11 03:19:35,352 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 605 states.
[2024-10-11 03:19:35,362 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 603.
[2024-10-11 03:19:35,363 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 603 states, 602 states have (on average 1.7192691029900333) internal successors, (1035), 602 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:35,365 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 1035 transitions.
[2024-10-11 03:19:35,365 INFO  L78                 Accepts]: Start accepts. Automaton has 603 states and 1035 transitions. Word has length 118
[2024-10-11 03:19:35,365 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-11 03:19:35,365 INFO  L471      AbstractCegarLoop]: Abstraction has 603 states and 1035 transitions.
[2024-10-11 03:19:35,366 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:35,366 INFO  L276                IsEmpty]: Start isEmpty. Operand 603 states and 1035 transitions.
[2024-10-11 03:19:35,368 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 122
[2024-10-11 03:19:35,368 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-11 03:19:35,368 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, 1, 1]
[2024-10-11 03:19:35,368 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-10-11 03:19:35,368 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-11 03:19:35,369 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-11 03:19:35,369 INFO  L85        PathProgramCache]: Analyzing trace with hash 1291342842, now seen corresponding path program 1 times
[2024-10-11 03:19:35,369 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-11 03:19:35,369 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003978692]
[2024-10-11 03:19:35,369 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-11 03:19:35,370 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-11 03:19:35,406 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 03:19:35,505 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-11 03:19:35,506 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-11 03:19:35,507 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003978692]
[2024-10-11 03:19:35,507 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003978692] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-11 03:19:35,507 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-11 03:19:35,508 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-11 03:19:35,508 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387795672]
[2024-10-11 03:19:35,508 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-11 03:19:35,509 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-11 03:19:35,509 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-11 03:19:35,509 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-11 03:19:35,510 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-11 03:19:35,511 INFO  L87              Difference]: Start difference. First operand 603 states and 1035 transitions. Second operand  has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:35,566 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-11 03:19:35,566 INFO  L93              Difference]: Finished difference Result 1008 states and 1746 transitions.
[2024-10-11 03:19:35,567 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-11 03:19:35,567 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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 121
[2024-10-11 03:19:35,568 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-11 03:19:35,571 INFO  L225             Difference]: With dead ends: 1008
[2024-10-11 03:19:35,572 INFO  L226             Difference]: Without dead ends: 788
[2024-10-11 03:19:35,572 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-11 03:19:35,574 INFO  L432           NwaCegarLoop]: 553 mSDtfsCounter, 121 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-11 03:19:35,577 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 991 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-11 03:19:35,578 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 788 states.
[2024-10-11 03:19:35,599 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 786.
[2024-10-11 03:19:35,601 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 786 states, 785 states have (on average 1.7222929936305733) internal successors, (1352), 785 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:35,602 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1352 transitions.
[2024-10-11 03:19:35,605 INFO  L78                 Accepts]: Start accepts. Automaton has 786 states and 1352 transitions. Word has length 121
[2024-10-11 03:19:35,605 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-11 03:19:35,605 INFO  L471      AbstractCegarLoop]: Abstraction has 786 states and 1352 transitions.
[2024-10-11 03:19:35,606 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:35,606 INFO  L276                IsEmpty]: Start isEmpty. Operand 786 states and 1352 transitions.
[2024-10-11 03:19:35,606 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 122
[2024-10-11 03:19:35,606 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-11 03:19:35,607 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, 1, 1]
[2024-10-11 03:19:35,607 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-10-11 03:19:35,607 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-11 03:19:35,609 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-11 03:19:35,609 INFO  L85        PathProgramCache]: Analyzing trace with hash -645813627, now seen corresponding path program 1 times
[2024-10-11 03:19:35,609 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-11 03:19:35,610 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500561662]
[2024-10-11 03:19:35,610 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-11 03:19:35,610 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-11 03:19:35,659 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 03:19:35,807 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-11 03:19:35,807 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-11 03:19:35,807 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500561662]
[2024-10-11 03:19:35,807 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500561662] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-11 03:19:35,807 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-11 03:19:35,807 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-11 03:19:35,807 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880003033]
[2024-10-11 03:19:35,807 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-11 03:19:35,808 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-11 03:19:35,808 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-11 03:19:35,808 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-11 03:19:35,808 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-11 03:19:35,808 INFO  L87              Difference]: Start difference. First operand 786 states and 1352 transitions. Second operand  has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:35,857 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-11 03:19:35,857 INFO  L93              Difference]: Finished difference Result 1879 states and 3259 transitions.
[2024-10-11 03:19:35,857 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-11 03:19:35,858 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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 121
[2024-10-11 03:19:35,858 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-11 03:19:35,862 INFO  L225             Difference]: With dead ends: 1879
[2024-10-11 03:19:35,863 INFO  L226             Difference]: Without dead ends: 1292
[2024-10-11 03:19:35,864 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-11 03:19:35,864 INFO  L432           NwaCegarLoop]: 551 mSDtfsCounter, 113 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-11 03:19:35,865 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 969 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-11 03:19:35,866 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1292 states.
[2024-10-11 03:19:35,890 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1290.
[2024-10-11 03:19:35,892 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1290 states, 1289 states have (on average 1.7214895267649342) internal successors, (2219), 1289 states have internal predecessors, (2219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:35,895 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 2219 transitions.
[2024-10-11 03:19:35,895 INFO  L78                 Accepts]: Start accepts. Automaton has 1290 states and 2219 transitions. Word has length 121
[2024-10-11 03:19:35,897 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-11 03:19:35,897 INFO  L471      AbstractCegarLoop]: Abstraction has 1290 states and 2219 transitions.
[2024-10-11 03:19:35,897 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:35,897 INFO  L276                IsEmpty]: Start isEmpty. Operand 1290 states and 2219 transitions.
[2024-10-11 03:19:35,899 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 125
[2024-10-11 03:19:35,899 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-11 03:19:35,899 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, 1, 1, 1, 1, 1]
[2024-10-11 03:19:35,899 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-10-11 03:19:35,901 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-11 03:19:35,901 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-11 03:19:35,901 INFO  L85        PathProgramCache]: Analyzing trace with hash -1710397733, now seen corresponding path program 1 times
[2024-10-11 03:19:35,902 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-11 03:19:35,902 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833156107]
[2024-10-11 03:19:35,902 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-11 03:19:35,902 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-11 03:19:35,936 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 03:19:36,005 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-11 03:19:36,006 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-11 03:19:36,006 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833156107]
[2024-10-11 03:19:36,006 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833156107] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-11 03:19:36,007 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-11 03:19:36,007 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-11 03:19:36,007 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986547883]
[2024-10-11 03:19:36,007 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-11 03:19:36,009 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-11 03:19:36,009 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-11 03:19:36,009 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-11 03:19:36,009 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-11 03:19:36,010 INFO  L87              Difference]: Start difference. First operand 1290 states and 2219 transitions. Second operand  has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:36,058 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-11 03:19:36,059 INFO  L93              Difference]: Finished difference Result 2345 states and 4056 transitions.
[2024-10-11 03:19:36,059 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-11 03:19:36,059 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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 124
[2024-10-11 03:19:36,060 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-11 03:19:36,065 INFO  L225             Difference]: With dead ends: 2345
[2024-10-11 03:19:36,065 INFO  L226             Difference]: Without dead ends: 1758
[2024-10-11 03:19:36,066 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-11 03:19:36,069 INFO  L432           NwaCegarLoop]: 542 mSDtfsCounter, 114 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-11 03:19:36,069 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 981 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-11 03:19:36,071 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1758 states.
[2024-10-11 03:19:36,100 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1756.
[2024-10-11 03:19:36,103 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1756 states, 1755 states have (on average 1.7179487179487178) internal successors, (3015), 1755 states have internal predecessors, (3015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:36,107 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 3015 transitions.
[2024-10-11 03:19:36,109 INFO  L78                 Accepts]: Start accepts. Automaton has 1756 states and 3015 transitions. Word has length 124
[2024-10-11 03:19:36,109 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-11 03:19:36,109 INFO  L471      AbstractCegarLoop]: Abstraction has 1756 states and 3015 transitions.
[2024-10-11 03:19:36,109 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:36,109 INFO  L276                IsEmpty]: Start isEmpty. Operand 1756 states and 3015 transitions.
[2024-10-11 03:19:36,110 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 125
[2024-10-11 03:19:36,110 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-11 03:19:36,110 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, 1, 1, 1, 1, 1]
[2024-10-11 03:19:36,111 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-10-11 03:19:36,111 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-11 03:19:36,111 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-11 03:19:36,111 INFO  L85        PathProgramCache]: Analyzing trace with hash -2059424284, now seen corresponding path program 1 times
[2024-10-11 03:19:36,111 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-11 03:19:36,111 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044281402]
[2024-10-11 03:19:36,112 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-11 03:19:36,112 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-11 03:19:36,142 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 03:19:36,264 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-11 03:19:36,264 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-11 03:19:36,265 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044281402]
[2024-10-11 03:19:36,265 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044281402] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-11 03:19:36,265 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-11 03:19:36,265 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-11 03:19:36,265 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598650548]
[2024-10-11 03:19:36,265 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-11 03:19:36,266 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-11 03:19:36,266 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-11 03:19:36,266 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-11 03:19:36,266 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-11 03:19:36,267 INFO  L87              Difference]: Start difference. First operand 1756 states and 3015 transitions. Second operand  has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:36,308 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-11 03:19:36,308 INFO  L93              Difference]: Finished difference Result 4613 states and 7922 transitions.
[2024-10-11 03:19:36,312 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-11 03:19:36,312 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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 124
[2024-10-11 03:19:36,313 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-11 03:19:36,321 INFO  L225             Difference]: With dead ends: 4613
[2024-10-11 03:19:36,321 INFO  L226             Difference]: Without dead ends: 3063
[2024-10-11 03:19:36,323 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-11 03:19:36,324 INFO  L432           NwaCegarLoop]: 541 mSDtfsCounter, 106 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-11 03:19:36,324 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 960 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-11 03:19:36,326 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3063 states.
[2024-10-11 03:19:36,372 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3063 to 3061.
[2024-10-11 03:19:36,377 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3061 states, 3060 states have (on average 1.7029411764705882) internal successors, (5211), 3060 states have internal predecessors, (5211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:36,383 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3061 states to 3061 states and 5211 transitions.
[2024-10-11 03:19:36,384 INFO  L78                 Accepts]: Start accepts. Automaton has 3061 states and 5211 transitions. Word has length 124
[2024-10-11 03:19:36,384 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-11 03:19:36,384 INFO  L471      AbstractCegarLoop]: Abstraction has 3061 states and 5211 transitions.
[2024-10-11 03:19:36,385 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:36,385 INFO  L276                IsEmpty]: Start isEmpty. Operand 3061 states and 5211 transitions.
[2024-10-11 03:19:36,386 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 128
[2024-10-11 03:19:36,387 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-11 03:19:36,387 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, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-11 03:19:36,387 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-10-11 03:19:36,387 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-11 03:19:36,390 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-11 03:19:36,391 INFO  L85        PathProgramCache]: Analyzing trace with hash -982220166, now seen corresponding path program 1 times
[2024-10-11 03:19:36,391 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-11 03:19:36,391 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386116679]
[2024-10-11 03:19:36,391 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-11 03:19:36,391 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-11 03:19:36,436 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 03:19:36,495 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-11 03:19:36,495 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-11 03:19:36,495 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386116679]
[2024-10-11 03:19:36,495 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386116679] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-11 03:19:36,495 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-11 03:19:36,495 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-11 03:19:36,496 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296687791]
[2024-10-11 03:19:36,496 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-11 03:19:36,496 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-11 03:19:36,496 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-11 03:19:36,496 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-11 03:19:36,497 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-11 03:19:36,497 INFO  L87              Difference]: Start difference. First operand 3061 states and 5211 transitions. Second operand  has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:36,572 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-11 03:19:36,572 INFO  L93              Difference]: Finished difference Result 5790 states and 9886 transitions.
[2024-10-11 03:19:36,573 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-11 03:19:36,573 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127
[2024-10-11 03:19:36,573 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-11 03:19:36,585 INFO  L225             Difference]: With dead ends: 5790
[2024-10-11 03:19:36,585 INFO  L226             Difference]: Without dead ends: 4240
[2024-10-11 03:19:36,589 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-11 03:19:36,589 INFO  L432           NwaCegarLoop]: 531 mSDtfsCounter, 107 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-11 03:19:36,590 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 971 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-11 03:19:36,593 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4240 states.
[2024-10-11 03:19:36,689 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4240 to 4238.
[2024-10-11 03:19:36,696 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4238 states, 4237 states have (on average 1.6931791361812603) internal successors, (7174), 4237 states have internal predecessors, (7174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:36,707 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4238 states to 4238 states and 7174 transitions.
[2024-10-11 03:19:36,708 INFO  L78                 Accepts]: Start accepts. Automaton has 4238 states and 7174 transitions. Word has length 127
[2024-10-11 03:19:36,708 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-11 03:19:36,708 INFO  L471      AbstractCegarLoop]: Abstraction has 4238 states and 7174 transitions.
[2024-10-11 03:19:36,708 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:36,708 INFO  L276                IsEmpty]: Start isEmpty. Operand 4238 states and 7174 transitions.
[2024-10-11 03:19:36,709 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 128
[2024-10-11 03:19:36,709 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-11 03:19:36,710 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, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-11 03:19:36,710 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-10-11 03:19:36,710 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-11 03:19:36,710 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-11 03:19:36,711 INFO  L85        PathProgramCache]: Analyzing trace with hash -1464193915, now seen corresponding path program 1 times
[2024-10-11 03:19:36,711 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-11 03:19:36,711 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471202350]
[2024-10-11 03:19:36,711 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-11 03:19:36,711 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-11 03:19:36,746 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 03:19:36,899 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-11 03:19:36,901 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-11 03:19:36,902 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471202350]
[2024-10-11 03:19:36,902 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471202350] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-11 03:19:36,902 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-11 03:19:36,902 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-10-11 03:19:36,902 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951628909]
[2024-10-11 03:19:36,902 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-11 03:19:36,902 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-10-11 03:19:36,903 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-11 03:19:36,903 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-10-11 03:19:36,903 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-10-11 03:19:36,903 INFO  L87              Difference]: Start difference. First operand 4238 states and 7174 transitions. Second operand  has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:37,387 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-11 03:19:37,387 INFO  L93              Difference]: Finished difference Result 27159 states and 46476 transitions.
[2024-10-11 03:19:37,388 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-10-11 03:19:37,388 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127
[2024-10-11 03:19:37,388 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-11 03:19:37,454 INFO  L225             Difference]: With dead ends: 27159
[2024-10-11 03:19:37,455 INFO  L226             Difference]: Without dead ends: 23134
[2024-10-11 03:19:37,468 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2024-10-11 03:19:37,468 INFO  L432           NwaCegarLoop]: 445 mSDtfsCounter, 1640 mSDsluCounter, 2299 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1640 SdHoareTripleChecker+Valid, 2744 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-10-11 03:19:37,469 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [1640 Valid, 2744 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-10-11 03:19:37,487 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23134 states.
[2024-10-11 03:19:37,787 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23134 to 8114.
[2024-10-11 03:19:37,903 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8114 states, 8113 states have (on average 1.6853198570195982) internal successors, (13673), 8113 states have internal predecessors, (13673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:37,924 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8114 states to 8114 states and 13673 transitions.
[2024-10-11 03:19:37,925 INFO  L78                 Accepts]: Start accepts. Automaton has 8114 states and 13673 transitions. Word has length 127
[2024-10-11 03:19:37,926 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-11 03:19:37,926 INFO  L471      AbstractCegarLoop]: Abstraction has 8114 states and 13673 transitions.
[2024-10-11 03:19:37,926 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:37,926 INFO  L276                IsEmpty]: Start isEmpty. Operand 8114 states and 13673 transitions.
[2024-10-11 03:19:37,927 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 129
[2024-10-11 03:19:37,927 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-11 03:19:37,927 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, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-11 03:19:37,927 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-10-11 03:19:37,927 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-11 03:19:37,928 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-11 03:19:37,928 INFO  L85        PathProgramCache]: Analyzing trace with hash 1786425182, now seen corresponding path program 1 times
[2024-10-11 03:19:37,928 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-11 03:19:37,928 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055104117]
[2024-10-11 03:19:37,928 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-11 03:19:37,928 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-11 03:19:37,961 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 03:19:38,066 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-11 03:19:38,066 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-11 03:19:38,066 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055104117]
[2024-10-11 03:19:38,067 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055104117] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-11 03:19:38,067 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-11 03:19:38,067 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-10-11 03:19:38,067 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192437473]
[2024-10-11 03:19:38,067 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-11 03:19:38,067 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-10-11 03:19:38,068 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-11 03:19:38,068 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-10-11 03:19:38,068 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-10-11 03:19:38,068 INFO  L87              Difference]: Start difference. First operand 8114 states and 13673 transitions. Second operand  has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:38,399 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-11 03:19:38,400 INFO  L93              Difference]: Finished difference Result 26847 states and 45588 transitions.
[2024-10-11 03:19:38,400 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-10-11 03:19:38,401 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 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 128
[2024-10-11 03:19:38,401 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-11 03:19:38,434 INFO  L225             Difference]: With dead ends: 26847
[2024-10-11 03:19:38,434 INFO  L226             Difference]: Without dead ends: 18946
[2024-10-11 03:19:38,445 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-10-11 03:19:38,446 INFO  L432           NwaCegarLoop]: 443 mSDtfsCounter, 419 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-11 03:19:38,446 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 1338 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-11 03:19:38,459 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 18946 states.
[2024-10-11 03:19:38,859 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 18946 to 13475.
[2024-10-11 03:19:38,890 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13475 states, 13474 states have (on average 1.684651922220573) internal successors, (22699), 13474 states have internal predecessors, (22699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:38,923 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13475 states to 13475 states and 22699 transitions.
[2024-10-11 03:19:38,924 INFO  L78                 Accepts]: Start accepts. Automaton has 13475 states and 22699 transitions. Word has length 128
[2024-10-11 03:19:38,924 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-11 03:19:38,924 INFO  L471      AbstractCegarLoop]: Abstraction has 13475 states and 22699 transitions.
[2024-10-11 03:19:38,925 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:38,925 INFO  L276                IsEmpty]: Start isEmpty. Operand 13475 states and 22699 transitions.
[2024-10-11 03:19:38,926 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 130
[2024-10-11 03:19:38,926 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-11 03:19:38,926 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-11 03:19:38,927 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-10-11 03:19:38,927 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-11 03:19:38,927 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-11 03:19:38,927 INFO  L85        PathProgramCache]: Analyzing trace with hash -518146162, now seen corresponding path program 1 times
[2024-10-11 03:19:38,928 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-11 03:19:38,928 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409765470]
[2024-10-11 03:19:38,928 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-11 03:19:38,928 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-11 03:19:38,970 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 03:19:39,106 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-11 03:19:39,108 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-11 03:19:39,108 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409765470]
[2024-10-11 03:19:39,108 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409765470] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-11 03:19:39,108 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-11 03:19:39,109 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-10-11 03:19:39,109 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673661626]
[2024-10-11 03:19:39,109 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-11 03:19:39,109 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-10-11 03:19:39,109 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-11 03:19:39,110 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-10-11 03:19:39,110 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-10-11 03:19:39,111 INFO  L87              Difference]: Start difference. First operand 13475 states and 22699 transitions. Second operand  has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:39,590 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-11 03:19:39,591 INFO  L93              Difference]: Finished difference Result 44285 states and 74776 transitions.
[2024-10-11 03:19:39,591 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-10-11 03:19:39,592 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129
[2024-10-11 03:19:39,592 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-11 03:19:39,658 INFO  L225             Difference]: With dead ends: 44285
[2024-10-11 03:19:39,658 INFO  L226             Difference]: Without dead ends: 31023
[2024-10-11 03:19:39,691 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-10-11 03:19:39,692 INFO  L432           NwaCegarLoop]: 444 mSDtfsCounter, 417 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-11 03:19:39,692 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 1441 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-11 03:19:39,725 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 31023 states.
[2024-10-11 03:19:40,253 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 31023 to 22160.
[2024-10-11 03:19:40,288 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 22160 states, 22159 states have (on average 1.6753012320050544) internal successors, (37123), 22159 states have internal predecessors, (37123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:40,328 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22160 states to 22160 states and 37123 transitions.
[2024-10-11 03:19:40,330 INFO  L78                 Accepts]: Start accepts. Automaton has 22160 states and 37123 transitions. Word has length 129
[2024-10-11 03:19:40,330 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-11 03:19:40,330 INFO  L471      AbstractCegarLoop]: Abstraction has 22160 states and 37123 transitions.
[2024-10-11 03:19:40,331 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:40,331 INFO  L276                IsEmpty]: Start isEmpty. Operand 22160 states and 37123 transitions.
[2024-10-11 03:19:40,332 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 131
[2024-10-11 03:19:40,332 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-11 03:19:40,332 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-11 03:19:40,332 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-10-11 03:19:40,332 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-11 03:19:40,332 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-11 03:19:40,333 INFO  L85        PathProgramCache]: Analyzing trace with hash 1060037959, now seen corresponding path program 1 times
[2024-10-11 03:19:40,333 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-11 03:19:40,333 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018481867]
[2024-10-11 03:19:40,333 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-11 03:19:40,333 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-11 03:19:40,361 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 03:19:40,571 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-11 03:19:40,571 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-11 03:19:40,571 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018481867]
[2024-10-11 03:19:40,571 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018481867] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-11 03:19:40,571 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-11 03:19:40,571 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-10-11 03:19:40,571 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113368423]
[2024-10-11 03:19:40,571 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-11 03:19:40,572 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-10-11 03:19:40,572 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-11 03:19:40,572 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-10-11 03:19:40,573 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-10-11 03:19:40,573 INFO  L87              Difference]: Start difference. First operand 22160 states and 37123 transitions. Second operand  has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:41,165 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-11 03:19:41,166 INFO  L93              Difference]: Finished difference Result 72619 states and 121924 transitions.
[2024-10-11 03:19:41,166 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-10-11 03:19:41,166 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 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 130
[2024-10-11 03:19:41,167 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-11 03:19:41,262 INFO  L225             Difference]: With dead ends: 72619
[2024-10-11 03:19:41,263 INFO  L226             Difference]: Without dead ends: 50672
[2024-10-11 03:19:41,285 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-10-11 03:19:41,286 INFO  L432           NwaCegarLoop]: 444 mSDtfsCounter, 415 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-11 03:19:41,286 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 1443 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-11 03:19:41,318 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 50672 states.
[2024-10-11 03:19:42,121 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 50672 to 36273.
[2024-10-11 03:19:42,181 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 36273 states, 36272 states have (on average 1.6659406704896338) internal successors, (60427), 36272 states have internal predecessors, (60427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:42,269 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 36273 states to 36273 states and 60427 transitions.
[2024-10-11 03:19:42,272 INFO  L78                 Accepts]: Start accepts. Automaton has 36273 states and 60427 transitions. Word has length 130
[2024-10-11 03:19:42,272 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-11 03:19:42,272 INFO  L471      AbstractCegarLoop]: Abstraction has 36273 states and 60427 transitions.
[2024-10-11 03:19:42,272 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:42,273 INFO  L276                IsEmpty]: Start isEmpty. Operand 36273 states and 60427 transitions.
[2024-10-11 03:19:42,274 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 132
[2024-10-11 03:19:42,274 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-11 03:19:42,274 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-11 03:19:42,274 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-10-11 03:19:42,274 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-11 03:19:42,275 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-11 03:19:42,275 INFO  L85        PathProgramCache]: Analyzing trace with hash -1550410089, now seen corresponding path program 1 times
[2024-10-11 03:19:42,275 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-11 03:19:42,275 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945839478]
[2024-10-11 03:19:42,275 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-11 03:19:42,275 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-11 03:19:42,311 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 03:19:42,545 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-11 03:19:42,546 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-11 03:19:42,546 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945839478]
[2024-10-11 03:19:42,546 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945839478] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-11 03:19:42,546 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-11 03:19:42,546 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-10-11 03:19:42,546 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840810714]
[2024-10-11 03:19:42,546 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-11 03:19:42,547 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-10-11 03:19:42,547 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-11 03:19:42,547 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-10-11 03:19:42,547 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-10-11 03:19:42,548 INFO  L87              Difference]: Start difference. First operand 36273 states and 60427 transitions. Second operand  has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:43,602 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-11 03:19:43,603 INFO  L93              Difference]: Finished difference Result 117553 states and 196264 transitions.
[2024-10-11 03:19:43,603 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-10-11 03:19:43,603 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131
[2024-10-11 03:19:43,604 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-11 03:19:43,803 INFO  L225             Difference]: With dead ends: 117553
[2024-10-11 03:19:43,803 INFO  L226             Difference]: Without dead ends: 81493
[2024-10-11 03:19:43,855 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-10-11 03:19:43,856 INFO  L432           NwaCegarLoop]: 450 mSDtfsCounter, 413 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-11 03:19:43,857 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 1451 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-11 03:19:43,918 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 81493 states.
[2024-10-11 03:19:45,319 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 81493 to 58658.
[2024-10-11 03:19:45,392 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 58658 states, 58657 states have (on average 1.656869597831461) internal successors, (97187), 58657 states have internal predecessors, (97187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:45,713 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 58658 states to 58658 states and 97187 transitions.
[2024-10-11 03:19:45,717 INFO  L78                 Accepts]: Start accepts. Automaton has 58658 states and 97187 transitions. Word has length 131
[2024-10-11 03:19:45,718 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-11 03:19:45,718 INFO  L471      AbstractCegarLoop]: Abstraction has 58658 states and 97187 transitions.
[2024-10-11 03:19:45,718 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:45,718 INFO  L276                IsEmpty]: Start isEmpty. Operand 58658 states and 97187 transitions.
[2024-10-11 03:19:45,719 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 134
[2024-10-11 03:19:45,719 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-11 03:19:45,719 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-11 03:19:45,720 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-10-11 03:19:45,720 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-11 03:19:45,720 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-11 03:19:45,720 INFO  L85        PathProgramCache]: Analyzing trace with hash -1067749953, now seen corresponding path program 1 times
[2024-10-11 03:19:45,720 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-11 03:19:45,720 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113521777]
[2024-10-11 03:19:45,721 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-11 03:19:45,721 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-11 03:19:45,750 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 03:19:46,191 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-11 03:19:46,192 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-11 03:19:46,192 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113521777]
[2024-10-11 03:19:46,192 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113521777] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-11 03:19:46,192 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-11 03:19:46,193 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-10-11 03:19:46,193 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345445859]
[2024-10-11 03:19:46,195 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-11 03:19:46,195 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-10-11 03:19:46,195 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-11 03:19:46,196 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-10-11 03:19:46,196 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-10-11 03:19:46,196 INFO  L87              Difference]: Start difference. First operand 58658 states and 97187 transitions. Second operand  has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:47,315 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-11 03:19:47,316 INFO  L93              Difference]: Finished difference Result 117105 states and 194033 transitions.
[2024-10-11 03:19:47,316 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-10-11 03:19:47,316 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 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 133
[2024-10-11 03:19:47,317 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-11 03:19:47,429 INFO  L225             Difference]: With dead ends: 117105
[2024-10-11 03:19:47,429 INFO  L226             Difference]: Without dead ends: 58660
[2024-10-11 03:19:47,478 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-10-11 03:19:47,480 INFO  L432           NwaCegarLoop]: 448 mSDtfsCounter, 427 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 1717 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-11 03:19:47,480 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 1717 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-11 03:19:47,522 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 58660 states.
[2024-10-11 03:19:48,521 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 58660 to 58658.
[2024-10-11 03:19:48,599 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 58658 states, 58657 states have (on average 1.6462144330599928) internal successors, (96562), 58657 states have internal predecessors, (96562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:48,908 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 58658 states to 58658 states and 96562 transitions.
[2024-10-11 03:19:48,912 INFO  L78                 Accepts]: Start accepts. Automaton has 58658 states and 96562 transitions. Word has length 133
[2024-10-11 03:19:48,913 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-11 03:19:48,913 INFO  L471      AbstractCegarLoop]: Abstraction has 58658 states and 96562 transitions.
[2024-10-11 03:19:48,913 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:48,913 INFO  L276                IsEmpty]: Start isEmpty. Operand 58658 states and 96562 transitions.
[2024-10-11 03:19:48,918 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 137
[2024-10-11 03:19:48,918 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-11 03:19:48,918 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-11 03:19:48,918 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-10-11 03:19:48,918 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-11 03:19:48,919 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-11 03:19:48,919 INFO  L85        PathProgramCache]: Analyzing trace with hash 1987540452, now seen corresponding path program 1 times
[2024-10-11 03:19:48,919 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-11 03:19:48,919 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495923871]
[2024-10-11 03:19:48,919 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-11 03:19:48,919 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-11 03:19:48,974 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 03:19:49,269 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-11 03:19:49,270 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-11 03:19:49,270 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495923871]
[2024-10-11 03:19:49,270 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495923871] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-11 03:19:49,271 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-11 03:19:49,271 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-10-11 03:19:49,271 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335354984]
[2024-10-11 03:19:49,271 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-11 03:19:49,271 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-10-11 03:19:49,272 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-11 03:19:49,272 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-10-11 03:19:49,272 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-10-11 03:19:49,272 INFO  L87              Difference]: Start difference. First operand 58658 states and 96562 transitions. Second operand  has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:50,781 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-11 03:19:50,781 INFO  L93              Difference]: Finished difference Result 171535 states and 282829 transitions.
[2024-10-11 03:19:50,782 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-10-11 03:19:50,782 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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 136
[2024-10-11 03:19:50,782 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-11 03:19:50,972 INFO  L225             Difference]: With dead ends: 171535
[2024-10-11 03:19:50,972 INFO  L226             Difference]: Without dead ends: 113090
[2024-10-11 03:19:51,016 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-10-11 03:19:51,017 INFO  L432           NwaCegarLoop]: 443 mSDtfsCounter, 107 mSDsluCounter, 1716 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 2159 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-11 03:19:51,018 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 2159 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-11 03:19:51,090 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 113090 states.
[2024-10-11 03:19:53,327 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 113090 to 113088.
[2024-10-11 03:19:53,463 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 113088 states, 113087 states have (on average 1.6322919522137822) internal successors, (184591), 113087 states have internal predecessors, (184591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:53,695 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 113088 states to 113088 states and 184591 transitions.
[2024-10-11 03:19:53,702 INFO  L78                 Accepts]: Start accepts. Automaton has 113088 states and 184591 transitions. Word has length 136
[2024-10-11 03:19:53,703 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-11 03:19:53,703 INFO  L471      AbstractCegarLoop]: Abstraction has 113088 states and 184591 transitions.
[2024-10-11 03:19:53,703 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:53,704 INFO  L276                IsEmpty]: Start isEmpty. Operand 113088 states and 184591 transitions.
[2024-10-11 03:19:53,704 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 138
[2024-10-11 03:19:53,705 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-11 03:19:53,705 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-11 03:19:53,705 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-10-11 03:19:53,705 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-11 03:19:53,705 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-11 03:19:53,706 INFO  L85        PathProgramCache]: Analyzing trace with hash 1469661750, now seen corresponding path program 1 times
[2024-10-11 03:19:53,706 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-11 03:19:53,706 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190726200]
[2024-10-11 03:19:53,706 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-11 03:19:53,706 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-11 03:19:53,812 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 03:19:54,040 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-11 03:19:54,040 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-11 03:19:54,040 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190726200]
[2024-10-11 03:19:54,040 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190726200] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-11 03:19:54,040 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-11 03:19:54,041 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-10-11 03:19:54,041 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377103256]
[2024-10-11 03:19:54,041 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-11 03:19:54,041 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-10-11 03:19:54,041 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-11 03:19:54,041 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-10-11 03:19:54,041 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-10-11 03:19:54,042 INFO  L87              Difference]: Start difference. First operand 113088 states and 184591 transitions. Second operand  has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:55,636 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-11 03:19:55,637 INFO  L93              Difference]: Finished difference Result 116963 states and 190401 transitions.
[2024-10-11 03:19:55,637 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-10-11 03:19:55,637 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 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 137
[2024-10-11 03:19:55,638 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-11 03:19:55,846 INFO  L225             Difference]: With dead ends: 116963
[2024-10-11 03:19:55,847 INFO  L226             Difference]: Without dead ends: 116961
[2024-10-11 03:19:55,875 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-10-11 03:19:55,876 INFO  L432           NwaCegarLoop]: 453 mSDtfsCounter, 0 mSDsluCounter, 1340 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1793 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-11 03:19:55,876 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1793 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-11 03:19:55,961 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 116961 states.
[2024-10-11 03:19:58,038 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 116961 to 116960.
[2024-10-11 03:19:58,135 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 116960 states, 116959 states have (on average 1.6111286861207774) internal successors, (188436), 116959 states have internal predecessors, (188436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:58,325 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 116960 states to 116960 states and 188436 transitions.
[2024-10-11 03:19:58,331 INFO  L78                 Accepts]: Start accepts. Automaton has 116960 states and 188436 transitions. Word has length 137
[2024-10-11 03:19:58,331 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-11 03:19:58,331 INFO  L471      AbstractCegarLoop]: Abstraction has 116960 states and 188436 transitions.
[2024-10-11 03:19:58,332 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:19:58,332 INFO  L276                IsEmpty]: Start isEmpty. Operand 116960 states and 188436 transitions.
[2024-10-11 03:19:58,336 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 172
[2024-10-11 03:19:58,336 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-11 03:19:58,336 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-11 03:19:58,337 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-10-11 03:19:58,337 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-11 03:19:58,337 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-11 03:19:58,337 INFO  L85        PathProgramCache]: Analyzing trace with hash -1115574285, now seen corresponding path program 1 times
[2024-10-11 03:19:58,337 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-11 03:19:58,337 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033597702]
[2024-10-11 03:19:58,338 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-11 03:19:58,338 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-11 03:19:58,658 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 03:19:58,783 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-11 03:19:58,784 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-11 03:19:58,784 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033597702]
[2024-10-11 03:19:58,784 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033597702] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-11 03:19:58,784 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-11 03:19:58,784 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-11 03:19:58,784 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174299159]
[2024-10-11 03:19:58,784 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-11 03:19:58,785 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-11 03:19:58,785 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-11 03:19:58,786 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-11 03:19:58,786 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-11 03:19:58,786 INFO  L87              Difference]: Start difference. First operand 116960 states and 188436 transitions. Second operand  has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:20:01,344 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-11 03:20:01,345 INFO  L93              Difference]: Finished difference Result 349877 states and 563316 transitions.
[2024-10-11 03:20:01,345 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-11 03:20:01,345 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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 171
[2024-10-11 03:20:01,346 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-11 03:20:02,336 INFO  L225             Difference]: With dead ends: 349877
[2024-10-11 03:20:02,336 INFO  L226             Difference]: Without dead ends: 232977
[2024-10-11 03:20:02,491 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-11 03:20:02,491 INFO  L432           NwaCegarLoop]: 759 mSDtfsCounter, 377 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-11 03:20:02,491 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 1200 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-11 03:20:02,604 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 232977 states.
[2024-10-11 03:20:07,021 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 232977 to 232975.
[2024-10-11 03:20:07,206 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 232975 states, 232974 states have (on average 1.5998695133362522) internal successors, (372728), 232974 states have internal predecessors, (372728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:20:07,682 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 232975 states to 232975 states and 372728 transitions.
[2024-10-11 03:20:07,692 INFO  L78                 Accepts]: Start accepts. Automaton has 232975 states and 372728 transitions. Word has length 171
[2024-10-11 03:20:07,693 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-11 03:20:07,693 INFO  L471      AbstractCegarLoop]: Abstraction has 232975 states and 372728 transitions.
[2024-10-11 03:20:07,693 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:20:07,694 INFO  L276                IsEmpty]: Start isEmpty. Operand 232975 states and 372728 transitions.
[2024-10-11 03:20:07,714 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 172
[2024-10-11 03:20:07,714 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-11 03:20:07,714 INFO  L215           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-11 03:20:07,715 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-10-11 03:20:07,715 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-11 03:20:07,715 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-11 03:20:07,715 INFO  L85        PathProgramCache]: Analyzing trace with hash 2085463740, now seen corresponding path program 1 times
[2024-10-11 03:20:07,715 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-11 03:20:07,715 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275419974]
[2024-10-11 03:20:07,715 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-11 03:20:07,715 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-11 03:20:07,770 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 03:20:07,849 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-10-11 03:20:07,850 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-11 03:20:07,850 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275419974]
[2024-10-11 03:20:07,850 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275419974] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-11 03:20:07,850 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-11 03:20:07,850 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-11 03:20:07,850 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950561283]
[2024-10-11 03:20:07,850 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-11 03:20:07,851 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-11 03:20:07,851 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-11 03:20:07,851 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-11 03:20:07,851 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-11 03:20:07,851 INFO  L87              Difference]: Start difference. First operand 232975 states and 372728 transitions. Second operand  has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-11 03:20:13,931 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-11 03:20:13,931 INFO  L93              Difference]: Finished difference Result 696911 states and 1114187 transitions.
[2024-10-11 03:20:13,932 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-11 03:20:13,932 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 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 171
[2024-10-11 03:20:13,932 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-11 03:20:15,350 INFO  L225             Difference]: With dead ends: 696911
[2024-10-11 03:20:15,351 INFO  L226             Difference]: Without dead ends: 464040
[2024-10-11 03:20:15,566 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-11 03:20:15,567 INFO  L432           NwaCegarLoop]: 689 mSDtfsCounter, 318 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-11 03:20:15,568 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 1130 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-11 03:20:15,952 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 464040 states.