./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-reduced/pals_floodmax.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a9066ec9ee7e14c7adf63eb106d945f26321fdd64b3726b0fe14ce5b202a77d4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 01:39:01,285 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 01:39:01,354 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 01:39:01,358 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 01:39:01,358 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 01:39:01,403 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 01:39:01,404 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 01:39:01,404 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 01:39:01,404 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 01:39:01,405 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 01:39:01,405 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 01:39:01,405 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 01:39:01,405 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 01:39:01,406 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 01:39:01,406 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 01:39:01,406 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 01:39:01,408 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 01:39:01,411 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 01:39:01,411 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 01:39:01,411 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 01:39:01,411 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 01:39:01,412 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 01:39:01,412 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 01:39:01,412 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 01:39:01,412 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 01:39:01,412 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 01:39:01,412 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 01:39:01,413 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 01:39:01,413 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 01:39:01,413 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 01:39:01,413 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 01:39:01,414 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 01:39:01,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:39:01,415 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 01:39:01,415 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 01:39:01,415 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 01:39:01,415 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 01:39:01,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 01:39:01,415 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 01:39:01,415 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 01:39:01,416 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 01:39:01,416 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 01:39:01,416 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a9066ec9ee7e14c7adf63eb106d945f26321fdd64b3726b0fe14ce5b202a77d4 [2024-10-24 01:39:01,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 01:39:01,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 01:39:01,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 01:39:01,655 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 01:39:01,655 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 01:39:01,656 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-24 01:39:02,878 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 01:39:03,104 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 01:39:03,104 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-24 01:39:03,120 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3dde41f6/bec2b9165d8c4f9c8a3db2d6c5a1baf3/FLAGb697609ea [2024-10-24 01:39:03,131 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3dde41f6/bec2b9165d8c4f9c8a3db2d6c5a1baf3 [2024-10-24 01:39:03,133 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 01:39:03,134 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 01:39:03,135 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 01:39:03,135 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 01:39:03,139 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 01:39:03,139 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:39:03" (1/1) ... [2024-10-24 01:39:03,140 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@307eb300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:39:03, skipping insertion in model container [2024-10-24 01:39:03,140 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:39:03" (1/1) ... [2024-10-24 01:39:03,197 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 01:39:03,497 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-reduced/pals_floodmax.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[21939,21952] [2024-10-24 01:39:03,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:39:03,674 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 01:39:03,752 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-reduced/pals_floodmax.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[21939,21952] [2024-10-24 01:39:03,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:39:03,828 INFO L204 MainTranslator]: Completed translation [2024-10-24 01:39:03,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:39:03 WrapperNode [2024-10-24 01:39:03,828 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 01:39:03,829 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 01:39:03,830 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 01:39:03,830 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 01:39:03,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:39:03" (1/1) ... [2024-10-24 01:39:03,860 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:39:03" (1/1) ... [2024-10-24 01:39:03,927 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2883 [2024-10-24 01:39:03,928 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 01:39:03,928 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 01:39:03,928 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 01:39:03,928 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 01:39:03,937 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:39:03" (1/1) ... [2024-10-24 01:39:03,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:39:03" (1/1) ... [2024-10-24 01:39:03,948 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:39:03" (1/1) ... [2024-10-24 01:39:03,976 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-24 01:39:03,976 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:39:03" (1/1) ... [2024-10-24 01:39:03,976 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:39:03" (1/1) ... [2024-10-24 01:39:04,000 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:39:03" (1/1) ... [2024-10-24 01:39:04,021 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:39:03" (1/1) ... [2024-10-24 01:39:04,034 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:39:03" (1/1) ... [2024-10-24 01:39:04,044 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:39:03" (1/1) ... [2024-10-24 01:39:04,062 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 01:39:04,063 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 01:39:04,064 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 01:39:04,064 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 01:39:04,064 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:39:03" (1/1) ... [2024-10-24 01:39:04,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:39:04,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:39:04,098 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 01:39:04,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 01:39:04,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 01:39:04,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 01:39:04,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 01:39:04,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 01:39:04,294 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 01:39:04,296 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 01:39:05,988 INFO L? ?]: Removed 251 outVars from TransFormulas that were not future-live. [2024-10-24 01:39:05,988 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 01:39:06,066 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 01:39:06,069 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 01:39:06,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:39:06 BoogieIcfgContainer [2024-10-24 01:39:06,070 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 01:39:06,072 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 01:39:06,072 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 01:39:06,075 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 01:39:06,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:39:03" (1/3) ... [2024-10-24 01:39:06,075 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ebbdfb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:39:06, skipping insertion in model container [2024-10-24 01:39:06,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:39:03" (2/3) ... [2024-10-24 01:39:06,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ebbdfb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:39:06, skipping insertion in model container [2024-10-24 01:39:06,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:39:06" (3/3) ... [2024-10-24 01:39:06,077 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-24 01:39:06,090 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 01:39:06,090 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 01:39:06,161 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 01:39:06,167 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;@20ca9c16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 01:39:06,167 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 01:39:06,177 INFO L276 IsEmpty]: Start isEmpty. Operand has 743 states, 741 states have (on average 1.8394062078272604) internal successors, (1363), 742 states have internal predecessors, (1363), 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-24 01:39:06,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-10-24 01:39:06,204 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:39:06,205 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:39:06,206 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:39:06,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:39:06,211 INFO L85 PathProgramCache]: Analyzing trace with hash 912866512, now seen corresponding path program 1 times [2024-10-24 01:39:06,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:39:06,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386709098] [2024-10-24 01:39:06,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:39:06,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:39:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:39:06,886 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-24 01:39:06,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:39:06,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386709098] [2024-10-24 01:39:06,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386709098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:39:06,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:39:06,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:39:06,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117671841] [2024-10-24 01:39:06,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:39:06,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:39:06,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:39:06,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:39:06,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:39:06,917 INFO L87 Difference]: Start difference. First operand has 743 states, 741 states have (on average 1.8394062078272604) internal successors, (1363), 742 states have internal predecessors, (1363), 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 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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-24 01:39:07,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:39:07,092 INFO L93 Difference]: Finished difference Result 1132 states and 2018 transitions. [2024-10-24 01:39:07,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:39:07,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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 202 [2024-10-24 01:39:07,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:39:07,118 INFO L225 Difference]: With dead ends: 1132 [2024-10-24 01:39:07,118 INFO L226 Difference]: Without dead ends: 927 [2024-10-24 01:39:07,121 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-24 01:39:07,125 INFO L432 NwaCegarLoop]: 1354 mSDtfsCounter, 351 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 2607 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:39:07,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 2607 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:39:07,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2024-10-24 01:39:07,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 924. [2024-10-24 01:39:07,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 923 states have (on average 1.7388949079089924) internal successors, (1605), 923 states have internal predecessors, (1605), 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-24 01:39:07,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1605 transitions. [2024-10-24 01:39:07,194 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1605 transitions. Word has length 202 [2024-10-24 01:39:07,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:39:07,195 INFO L471 AbstractCegarLoop]: Abstraction has 924 states and 1605 transitions. [2024-10-24 01:39:07,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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-24 01:39:07,195 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1605 transitions. [2024-10-24 01:39:07,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-24 01:39:07,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:39:07,198 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:39:07,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 01:39:07,198 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:39:07,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:39:07,199 INFO L85 PathProgramCache]: Analyzing trace with hash 24499245, now seen corresponding path program 1 times [2024-10-24 01:39:07,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:39:07,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497818478] [2024-10-24 01:39:07,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:39:07,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:39:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:39:07,472 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-24 01:39:07,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:39:07,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497818478] [2024-10-24 01:39:07,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497818478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:39:07,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:39:07,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:39:07,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062687220] [2024-10-24 01:39:07,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:39:07,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:39:07,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:39:07,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:39:07,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:39:07,480 INFO L87 Difference]: Start difference. First operand 924 states and 1605 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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-24 01:39:07,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:39:07,534 INFO L93 Difference]: Finished difference Result 1666 states and 2849 transitions. [2024-10-24 01:39:07,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:39:07,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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 206 [2024-10-24 01:39:07,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:39:07,541 INFO L225 Difference]: With dead ends: 1666 [2024-10-24 01:39:07,541 INFO L226 Difference]: Without dead ends: 1284 [2024-10-24 01:39:07,546 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-24 01:39:07,547 INFO L432 NwaCegarLoop]: 1296 mSDtfsCounter, 306 mSDsluCounter, 1247 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 2543 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:39:07,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 2543 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:39:07,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2024-10-24 01:39:07,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1280. [2024-10-24 01:39:07,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1279 states have (on average 1.7193119624706803) internal successors, (2199), 1279 states have internal predecessors, (2199), 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-24 01:39:07,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 2199 transitions. [2024-10-24 01:39:07,581 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 2199 transitions. Word has length 206 [2024-10-24 01:39:07,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:39:07,582 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 2199 transitions. [2024-10-24 01:39:07,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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-24 01:39:07,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 2199 transitions. [2024-10-24 01:39:07,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-24 01:39:07,587 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:39:07,587 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:39:07,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 01:39:07,588 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:39:07,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:39:07,588 INFO L85 PathProgramCache]: Analyzing trace with hash -567899920, now seen corresponding path program 1 times [2024-10-24 01:39:07,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:39:07,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014109547] [2024-10-24 01:39:07,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:39:07,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:39:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:39:07,856 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-24 01:39:07,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:39:07,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014109547] [2024-10-24 01:39:07,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014109547] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:39:07,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:39:07,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:39:07,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966054151] [2024-10-24 01:39:07,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:39:07,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:39:07,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:39:07,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:39:07,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:39:07,861 INFO L87 Difference]: Start difference. First operand 1280 states and 2199 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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-24 01:39:07,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:39:07,947 INFO L93 Difference]: Finished difference Result 2712 states and 4589 transitions. [2024-10-24 01:39:07,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:39:07,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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 210 [2024-10-24 01:39:07,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:39:07,955 INFO L225 Difference]: With dead ends: 2712 [2024-10-24 01:39:07,955 INFO L226 Difference]: Without dead ends: 1974 [2024-10-24 01:39:07,957 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-24 01:39:07,960 INFO L432 NwaCegarLoop]: 1296 mSDtfsCounter, 299 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 2544 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:39:07,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 2544 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:39:07,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2024-10-24 01:39:07,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1968. [2024-10-24 01:39:07,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1968 states, 1967 states have (on average 1.697508896797153) internal successors, (3339), 1967 states have internal predecessors, (3339), 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-24 01:39:07,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1968 states and 3339 transitions. [2024-10-24 01:39:07,993 INFO L78 Accepts]: Start accepts. Automaton has 1968 states and 3339 transitions. Word has length 210 [2024-10-24 01:39:07,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:39:07,994 INFO L471 AbstractCegarLoop]: Abstraction has 1968 states and 3339 transitions. [2024-10-24 01:39:07,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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-24 01:39:07,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1968 states and 3339 transitions. [2024-10-24 01:39:08,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-24 01:39:08,000 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:39:08,000 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:39:08,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 01:39:08,001 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:39:08,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:39:08,001 INFO L85 PathProgramCache]: Analyzing trace with hash 319621645, now seen corresponding path program 1 times [2024-10-24 01:39:08,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:39:08,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192466070] [2024-10-24 01:39:08,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:39:08,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:39:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:39:08,251 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-24 01:39:08,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:39:08,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192466070] [2024-10-24 01:39:08,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192466070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:39:08,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:39:08,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:39:08,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184191447] [2024-10-24 01:39:08,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:39:08,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:39:08,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:39:08,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:39:08,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:39:08,253 INFO L87 Difference]: Start difference. First operand 1968 states and 3339 transitions. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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-24 01:39:08,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:39:08,312 INFO L93 Difference]: Finished difference Result 4732 states and 7925 transitions. [2024-10-24 01:39:08,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:39:08,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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 214 [2024-10-24 01:39:08,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:39:08,321 INFO L225 Difference]: With dead ends: 4732 [2024-10-24 01:39:08,321 INFO L226 Difference]: Without dead ends: 3306 [2024-10-24 01:39:08,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-24 01:39:08,324 INFO L432 NwaCegarLoop]: 1296 mSDtfsCounter, 292 mSDsluCounter, 1249 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 2545 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:39:08,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 2545 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:39:08,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3306 states. [2024-10-24 01:39:08,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3306 to 3296. [2024-10-24 01:39:08,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3296 states, 3295 states have (on average 1.676176024279211) internal successors, (5523), 3295 states have internal predecessors, (5523), 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-24 01:39:08,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3296 states to 3296 states and 5523 transitions. [2024-10-24 01:39:08,380 INFO L78 Accepts]: Start accepts. Automaton has 3296 states and 5523 transitions. Word has length 214 [2024-10-24 01:39:08,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:39:08,381 INFO L471 AbstractCegarLoop]: Abstraction has 3296 states and 5523 transitions. [2024-10-24 01:39:08,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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-24 01:39:08,381 INFO L276 IsEmpty]: Start isEmpty. Operand 3296 states and 5523 transitions. [2024-10-24 01:39:08,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-10-24 01:39:08,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:39:08,384 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:39:08,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 01:39:08,384 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:39:08,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:39:08,385 INFO L85 PathProgramCache]: Analyzing trace with hash -859099888, now seen corresponding path program 1 times [2024-10-24 01:39:08,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:39:08,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889855370] [2024-10-24 01:39:08,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:39:08,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:39:08,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:39:08,611 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-24 01:39:08,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:39:08,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889855370] [2024-10-24 01:39:08,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889855370] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:39:08,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:39:08,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:39:08,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787328516] [2024-10-24 01:39:08,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:39:08,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:39:08,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:39:08,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:39:08,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:39:08,614 INFO L87 Difference]: Start difference. First operand 3296 states and 5523 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:39:08,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:39:08,732 INFO L93 Difference]: Finished difference Result 8628 states and 14309 transitions. [2024-10-24 01:39:08,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:39:08,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 218 [2024-10-24 01:39:08,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:39:08,748 INFO L225 Difference]: With dead ends: 8628 [2024-10-24 01:39:08,749 INFO L226 Difference]: Without dead ends: 5874 [2024-10-24 01:39:08,753 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-24 01:39:08,754 INFO L432 NwaCegarLoop]: 1296 mSDtfsCounter, 285 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 2546 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:39:08,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 2546 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:39:08,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5874 states. [2024-10-24 01:39:08,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5874 to 5856. [2024-10-24 01:39:08,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5856 states, 5855 states have (on average 1.656532877882152) internal successors, (9699), 5855 states have internal predecessors, (9699), 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-24 01:39:08,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5856 states to 5856 states and 9699 transitions. [2024-10-24 01:39:08,843 INFO L78 Accepts]: Start accepts. Automaton has 5856 states and 9699 transitions. Word has length 218 [2024-10-24 01:39:08,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:39:08,844 INFO L471 AbstractCegarLoop]: Abstraction has 5856 states and 9699 transitions. [2024-10-24 01:39:08,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:39:08,844 INFO L276 IsEmpty]: Start isEmpty. Operand 5856 states and 9699 transitions. [2024-10-24 01:39:08,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-24 01:39:08,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:39:08,848 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:39:08,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 01:39:08,849 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:39:08,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:39:08,849 INFO L85 PathProgramCache]: Analyzing trace with hash -926029843, now seen corresponding path program 1 times [2024-10-24 01:39:08,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:39:08,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754050901] [2024-10-24 01:39:08,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:39:08,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:39:08,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:39:09,218 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-24 01:39:09,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:39:09,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754050901] [2024-10-24 01:39:09,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754050901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:39:09,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:39:09,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:39:09,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275913938] [2024-10-24 01:39:09,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:39:09,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:39:09,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:39:09,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:39:09,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:39:09,220 INFO L87 Difference]: Start difference. First operand 5856 states and 9699 transitions. Second operand has 7 states, 7 states have (on average 31.714285714285715) internal successors, (222), 7 states have internal predecessors, (222), 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-24 01:39:09,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:39:09,784 INFO L93 Difference]: Finished difference Result 35860 states and 59453 transitions. [2024-10-24 01:39:09,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 01:39:09,784 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 31.714285714285715) internal successors, (222), 7 states have internal predecessors, (222), 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 222 [2024-10-24 01:39:09,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:39:09,899 INFO L225 Difference]: With dead ends: 35860 [2024-10-24 01:39:09,900 INFO L226 Difference]: Without dead ends: 30546 [2024-10-24 01:39:09,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-10-24 01:39:09,909 INFO L432 NwaCegarLoop]: 1297 mSDtfsCounter, 3892 mSDsluCounter, 11564 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3892 SdHoareTripleChecker+Valid, 12861 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:39:09,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3892 Valid, 12861 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 01:39:09,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30546 states. [2024-10-24 01:39:10,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30546 to 10973. [2024-10-24 01:39:10,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10973 states, 10972 states have (on average 1.6499270871308787) internal successors, (18103), 10972 states have internal predecessors, (18103), 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-24 01:39:10,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10973 states to 10973 states and 18103 transitions. [2024-10-24 01:39:10,186 INFO L78 Accepts]: Start accepts. Automaton has 10973 states and 18103 transitions. Word has length 222 [2024-10-24 01:39:10,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:39:10,187 INFO L471 AbstractCegarLoop]: Abstraction has 10973 states and 18103 transitions. [2024-10-24 01:39:10,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 31.714285714285715) internal successors, (222), 7 states have internal predecessors, (222), 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-24 01:39:10,188 INFO L276 IsEmpty]: Start isEmpty. Operand 10973 states and 18103 transitions. [2024-10-24 01:39:10,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-24 01:39:10,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:39:10,193 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:39:10,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 01:39:10,193 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:39:10,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:39:10,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1286226212, now seen corresponding path program 1 times [2024-10-24 01:39:10,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:39:10,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256002330] [2024-10-24 01:39:10,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:39:10,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:39:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:39:10,442 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-24 01:39:10,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:39:10,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256002330] [2024-10-24 01:39:10,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256002330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:39:10,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:39:10,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:39:10,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527133385] [2024-10-24 01:39:10,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:39:10,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:39:10,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:39:10,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:39:10,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:39:10,445 INFO L87 Difference]: Start difference. First operand 10973 states and 18103 transitions. Second operand has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 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-24 01:39:10,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:39:10,606 INFO L93 Difference]: Finished difference Result 32182 states and 53196 transitions. [2024-10-24 01:39:10,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:39:10,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 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 223 [2024-10-24 01:39:10,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:39:10,641 INFO L225 Difference]: With dead ends: 32182 [2024-10-24 01:39:10,641 INFO L226 Difference]: Without dead ends: 21751 [2024-10-24 01:39:10,661 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-24 01:39:10,661 INFO L432 NwaCegarLoop]: 1292 mSDtfsCounter, 982 mSDsluCounter, 2871 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 4163 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:39:10,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [982 Valid, 4163 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:39:10,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21751 states. [2024-10-24 01:39:10,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21751 to 16329. [2024-10-24 01:39:11,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16329 states, 16328 states have (on average 1.6507839294463498) internal successors, (26954), 16328 states have internal predecessors, (26954), 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-24 01:39:11,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16329 states to 16329 states and 26954 transitions. [2024-10-24 01:39:11,043 INFO L78 Accepts]: Start accepts. Automaton has 16329 states and 26954 transitions. Word has length 223 [2024-10-24 01:39:11,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:39:11,043 INFO L471 AbstractCegarLoop]: Abstraction has 16329 states and 26954 transitions. [2024-10-24 01:39:11,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 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-24 01:39:11,044 INFO L276 IsEmpty]: Start isEmpty. Operand 16329 states and 26954 transitions. [2024-10-24 01:39:11,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-10-24 01:39:11,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:39:11,051 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:39:11,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 01:39:11,052 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:39:11,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:39:11,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1151245204, now seen corresponding path program 1 times [2024-10-24 01:39:11,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:39:11,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362648362] [2024-10-24 01:39:11,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:39:11,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:39:11,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:39:11,247 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-24 01:39:11,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:39:11,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362648362] [2024-10-24 01:39:11,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362648362] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:39:11,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:39:11,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:39:11,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900259393] [2024-10-24 01:39:11,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:39:11,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:39:11,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:39:11,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:39:11,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:39:11,250 INFO L87 Difference]: Start difference. First operand 16329 states and 26954 transitions. Second operand has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 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-24 01:39:11,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:39:11,419 INFO L93 Difference]: Finished difference Result 48154 states and 79554 transitions. [2024-10-24 01:39:11,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:39:11,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 224 [2024-10-24 01:39:11,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:39:11,474 INFO L225 Difference]: With dead ends: 48154 [2024-10-24 01:39:11,474 INFO L226 Difference]: Without dead ends: 32367 [2024-10-24 01:39:11,503 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-24 01:39:11,504 INFO L432 NwaCegarLoop]: 1289 mSDtfsCounter, 980 mSDsluCounter, 2678 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 3967 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:39:11,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [980 Valid, 3967 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:39:11,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32367 states. [2024-10-24 01:39:11,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32367 to 24300. [2024-10-24 01:39:11,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24300 states, 24299 states have (on average 1.6491625169760074) internal successors, (40073), 24299 states have internal predecessors, (40073), 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-24 01:39:12,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24300 states to 24300 states and 40073 transitions. [2024-10-24 01:39:12,094 INFO L78 Accepts]: Start accepts. Automaton has 24300 states and 40073 transitions. Word has length 224 [2024-10-24 01:39:12,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:39:12,095 INFO L471 AbstractCegarLoop]: Abstraction has 24300 states and 40073 transitions. [2024-10-24 01:39:12,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 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-24 01:39:12,095 INFO L276 IsEmpty]: Start isEmpty. Operand 24300 states and 40073 transitions. [2024-10-24 01:39:12,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-24 01:39:12,103 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:39:12,103 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:39:12,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 01:39:12,103 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:39:12,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:39:12,104 INFO L85 PathProgramCache]: Analyzing trace with hash -904618484, now seen corresponding path program 1 times [2024-10-24 01:39:12,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:39:12,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696208391] [2024-10-24 01:39:12,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:39:12,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:39:12,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:39:12,234 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-24 01:39:12,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:39:12,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696208391] [2024-10-24 01:39:12,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696208391] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:39:12,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:39:12,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:39:12,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203294615] [2024-10-24 01:39:12,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:39:12,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:39:12,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:39:12,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:39:12,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:39:12,237 INFO L87 Difference]: Start difference. First operand 24300 states and 40073 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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-24 01:39:12,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:39:12,446 INFO L93 Difference]: Finished difference Result 53888 states and 89152 transitions. [2024-10-24 01:39:12,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:39:12,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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 225 [2024-10-24 01:39:12,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:39:12,502 INFO L225 Difference]: With dead ends: 53888 [2024-10-24 01:39:12,502 INFO L226 Difference]: Without dead ends: 37472 [2024-10-24 01:39:12,523 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-24 01:39:12,526 INFO L432 NwaCegarLoop]: 1566 mSDtfsCounter, 312 mSDsluCounter, 1255 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 2821 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:39:12,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 2821 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:39:12,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37472 states. [2024-10-24 01:39:12,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37472 to 37470. [2024-10-24 01:39:12,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37470 states, 37469 states have (on average 1.6490965865115161) internal successors, (61790), 37469 states have internal predecessors, (61790), 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-24 01:39:13,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37470 states to 37470 states and 61790 transitions. [2024-10-24 01:39:13,198 INFO L78 Accepts]: Start accepts. Automaton has 37470 states and 61790 transitions. Word has length 225 [2024-10-24 01:39:13,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:39:13,198 INFO L471 AbstractCegarLoop]: Abstraction has 37470 states and 61790 transitions. [2024-10-24 01:39:13,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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-24 01:39:13,199 INFO L276 IsEmpty]: Start isEmpty. Operand 37470 states and 61790 transitions. [2024-10-24 01:39:13,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-24 01:39:13,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:39:13,202 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:39:13,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 01:39:13,203 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:39:13,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:39:13,203 INFO L85 PathProgramCache]: Analyzing trace with hash 6896527, now seen corresponding path program 1 times [2024-10-24 01:39:13,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:39:13,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261102077] [2024-10-24 01:39:13,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:39:13,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:39:13,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:39:13,333 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-24 01:39:13,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:39:13,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261102077] [2024-10-24 01:39:13,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261102077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:39:13,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:39:13,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:39:13,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177982318] [2024-10-24 01:39:13,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:39:13,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:39:13,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:39:13,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:39:13,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:39:13,335 INFO L87 Difference]: Start difference. First operand 37470 states and 61790 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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-24 01:39:13,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:39:13,688 INFO L93 Difference]: Finished difference Result 82780 states and 136696 transitions. [2024-10-24 01:39:13,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:39:13,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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 225 [2024-10-24 01:39:13,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:39:13,775 INFO L225 Difference]: With dead ends: 82780 [2024-10-24 01:39:13,776 INFO L226 Difference]: Without dead ends: 57427 [2024-10-24 01:39:13,804 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-24 01:39:13,805 INFO L432 NwaCegarLoop]: 1539 mSDtfsCounter, 305 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 2795 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:39:13,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 2795 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:39:13,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57427 states. [2024-10-24 01:39:14,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57427 to 57425. [2024-10-24 01:39:14,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57425 states, 57424 states have (on average 1.6464718584563944) internal successors, (94547), 57424 states have internal predecessors, (94547), 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-24 01:39:14,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57425 states to 57425 states and 94547 transitions. [2024-10-24 01:39:14,645 INFO L78 Accepts]: Start accepts. Automaton has 57425 states and 94547 transitions. Word has length 225 [2024-10-24 01:39:14,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:39:14,645 INFO L471 AbstractCegarLoop]: Abstraction has 57425 states and 94547 transitions. [2024-10-24 01:39:14,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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-24 01:39:14,645 INFO L276 IsEmpty]: Start isEmpty. Operand 57425 states and 94547 transitions. [2024-10-24 01:39:14,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-24 01:39:14,649 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:39:14,649 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:39:14,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 01:39:14,649 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:39:14,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:39:14,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1472369538, now seen corresponding path program 1 times [2024-10-24 01:39:14,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:39:14,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142689529] [2024-10-24 01:39:14,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:39:14,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:39:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:39:14,926 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-24 01:39:14,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:39:14,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142689529] [2024-10-24 01:39:14,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142689529] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:39:14,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:39:14,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:39:14,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204537333] [2024-10-24 01:39:14,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:39:14,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:39:14,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:39:14,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:39:14,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:39:14,928 INFO L87 Difference]: Start difference. First operand 57425 states and 94547 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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-24 01:39:15,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:39:15,335 INFO L93 Difference]: Finished difference Result 110853 states and 182946 transitions. [2024-10-24 01:39:15,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:39:15,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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 225 [2024-10-24 01:39:15,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:39:15,439 INFO L225 Difference]: With dead ends: 110853 [2024-10-24 01:39:15,439 INFO L226 Difference]: Without dead ends: 80650 [2024-10-24 01:39:15,458 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-24 01:39:15,459 INFO L432 NwaCegarLoop]: 1505 mSDtfsCounter, 298 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 2762 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:39:15,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 2762 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:39:15,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80650 states. [2024-10-24 01:39:16,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80650 to 80648. [2024-10-24 01:39:16,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80648 states, 80647 states have (on average 1.6449712946544819) internal successors, (132662), 80647 states have internal predecessors, (132662), 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-24 01:39:16,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80648 states to 80648 states and 132662 transitions. [2024-10-24 01:39:16,408 INFO L78 Accepts]: Start accepts. Automaton has 80648 states and 132662 transitions. Word has length 225 [2024-10-24 01:39:16,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:39:16,408 INFO L471 AbstractCegarLoop]: Abstraction has 80648 states and 132662 transitions. [2024-10-24 01:39:16,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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-24 01:39:16,409 INFO L276 IsEmpty]: Start isEmpty. Operand 80648 states and 132662 transitions. [2024-10-24 01:39:16,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-24 01:39:16,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:39:16,412 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:39:16,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 01:39:16,412 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:39:16,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:39:16,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1266359275, now seen corresponding path program 1 times [2024-10-24 01:39:16,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:39:16,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901365452] [2024-10-24 01:39:16,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:39:16,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:39:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:39:16,921 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-24 01:39:16,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:39:16,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901365452] [2024-10-24 01:39:16,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901365452] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:39:16,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:39:16,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:39:16,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971999836] [2024-10-24 01:39:16,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:39:16,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:39:16,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:39:16,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:39:16,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:39:16,924 INFO L87 Difference]: Start difference. First operand 80648 states and 132662 transitions. Second operand has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 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-24 01:39:17,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:39:17,872 INFO L93 Difference]: Finished difference Result 263137 states and 433581 transitions. [2024-10-24 01:39:17,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:39:17,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 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 225 [2024-10-24 01:39:17,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:39:18,141 INFO L225 Difference]: With dead ends: 263137 [2024-10-24 01:39:18,142 INFO L226 Difference]: Without dead ends: 183078 [2024-10-24 01:39:18,199 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-24 01:39:18,200 INFO L432 NwaCegarLoop]: 1287 mSDtfsCounter, 978 mSDsluCounter, 2551 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 3838 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:39:18,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 3838 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:39:18,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183078 states. [2024-10-24 01:39:19,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183078 to 131670. [2024-10-24 01:39:19,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131670 states, 131669 states have (on average 1.6431430329082777) internal successors, (216351), 131669 states have internal predecessors, (216351), 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-24 01:39:20,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131670 states to 131670 states and 216351 transitions. [2024-10-24 01:39:20,384 INFO L78 Accepts]: Start accepts. Automaton has 131670 states and 216351 transitions. Word has length 225 [2024-10-24 01:39:20,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:39:20,384 INFO L471 AbstractCegarLoop]: Abstraction has 131670 states and 216351 transitions. [2024-10-24 01:39:20,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 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-24 01:39:20,384 INFO L276 IsEmpty]: Start isEmpty. Operand 131670 states and 216351 transitions. [2024-10-24 01:39:20,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-24 01:39:20,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:39:20,390 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:39:20,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 01:39:20,390 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:39:20,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:39:20,391 INFO L85 PathProgramCache]: Analyzing trace with hash 518702584, now seen corresponding path program 1 times [2024-10-24 01:39:20,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:39:20,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49335300] [2024-10-24 01:39:20,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:39:20,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:39:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:39:20,618 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-24 01:39:20,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:39:20,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49335300] [2024-10-24 01:39:20,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49335300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:39:20,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:39:20,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:39:20,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822691105] [2024-10-24 01:39:20,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:39:20,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:39:20,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:39:20,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:39:20,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:39:20,620 INFO L87 Difference]: Start difference. First operand 131670 states and 216351 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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-24 01:39:21,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:39:21,206 INFO L93 Difference]: Finished difference Result 254639 states and 419556 transitions. [2024-10-24 01:39:21,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:39:21,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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 225 [2024-10-24 01:39:21,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:39:21,864 INFO L225 Difference]: With dead ends: 254639 [2024-10-24 01:39:21,864 INFO L226 Difference]: Without dead ends: 184434 [2024-10-24 01:39:21,922 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-24 01:39:21,924 INFO L432 NwaCegarLoop]: 1411 mSDtfsCounter, 284 mSDsluCounter, 1259 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 2670 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:39:21,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 2670 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:39:22,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184434 states. [2024-10-24 01:39:23,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184434 to 184432. [2024-10-24 01:39:23,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184432 states, 184431 states have (on average 1.6415244725669762) internal successors, (302748), 184431 states have internal predecessors, (302748), 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-24 01:39:24,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184432 states to 184432 states and 302748 transitions. [2024-10-24 01:39:24,189 INFO L78 Accepts]: Start accepts. Automaton has 184432 states and 302748 transitions. Word has length 225 [2024-10-24 01:39:24,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:39:24,189 INFO L471 AbstractCegarLoop]: Abstraction has 184432 states and 302748 transitions. [2024-10-24 01:39:24,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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-24 01:39:24,190 INFO L276 IsEmpty]: Start isEmpty. Operand 184432 states and 302748 transitions. [2024-10-24 01:39:24,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-24 01:39:24,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:39:24,192 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:39:24,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 01:39:24,192 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:39:24,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:39:24,193 INFO L85 PathProgramCache]: Analyzing trace with hash -555078759, now seen corresponding path program 1 times [2024-10-24 01:39:24,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:39:24,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821958351] [2024-10-24 01:39:24,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:39:24,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:39:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:39:24,375 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-24 01:39:24,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:39:24,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821958351] [2024-10-24 01:39:24,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821958351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:39:24,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:39:24,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:39:24,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183391464] [2024-10-24 01:39:24,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:39:24,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:39:24,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:39:24,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:39:24,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:39:24,378 INFO L87 Difference]: Start difference. First operand 184432 states and 302748 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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-24 01:39:25,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:39:25,823 INFO L93 Difference]: Finished difference Result 354286 states and 583400 transitions. [2024-10-24 01:39:25,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:39:25,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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 225 [2024-10-24 01:39:25,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:39:26,241 INFO L225 Difference]: With dead ends: 354286 [2024-10-24 01:39:26,242 INFO L226 Difference]: Without dead ends: 256218 [2024-10-24 01:39:26,345 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-24 01:39:26,345 INFO L432 NwaCegarLoop]: 1470 mSDtfsCounter, 291 mSDsluCounter, 1258 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 2728 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:39:26,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 2728 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:39:26,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256218 states. [2024-10-24 01:39:29,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256218 to 256216. [2024-10-24 01:39:29,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256216 states, 256215 states have (on average 1.6399156958023535) internal successors, (420171), 256215 states have internal predecessors, (420171), 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-24 01:39:30,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256216 states to 256216 states and 420171 transitions. [2024-10-24 01:39:30,030 INFO L78 Accepts]: Start accepts. Automaton has 256216 states and 420171 transitions. Word has length 225 [2024-10-24 01:39:30,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:39:30,030 INFO L471 AbstractCegarLoop]: Abstraction has 256216 states and 420171 transitions. [2024-10-24 01:39:30,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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-24 01:39:30,030 INFO L276 IsEmpty]: Start isEmpty. Operand 256216 states and 420171 transitions. [2024-10-24 01:39:30,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-10-24 01:39:30,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:39:30,032 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:39:30,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 01:39:30,032 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:39:30,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:39:30,033 INFO L85 PathProgramCache]: Analyzing trace with hash 544486203, now seen corresponding path program 1 times [2024-10-24 01:39:30,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:39:30,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310332992] [2024-10-24 01:39:30,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:39:30,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:39:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:39:30,266 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-24 01:39:30,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:39:30,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310332992] [2024-10-24 01:39:30,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310332992] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:39:30,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:39:30,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:39:30,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176243] [2024-10-24 01:39:30,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:39:30,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:39:30,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:39:30,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:39:30,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:39:30,269 INFO L87 Difference]: Start difference. First operand 256216 states and 420171 transitions. Second operand has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:39:33,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:39:33,569 INFO L93 Difference]: Finished difference Result 838811 states and 1378557 transitions. [2024-10-24 01:39:33,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:39:33,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 226 [2024-10-24 01:39:33,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:39:34,581 INFO L225 Difference]: With dead ends: 838811 [2024-10-24 01:39:34,581 INFO L226 Difference]: Without dead ends: 583230 [2024-10-24 01:39:34,731 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-24 01:39:34,731 INFO L432 NwaCegarLoop]: 1288 mSDtfsCounter, 976 mSDsluCounter, 2877 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 976 SdHoareTripleChecker+Valid, 4165 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:39:34,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [976 Valid, 4165 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:39:35,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583230 states. [2024-10-24 01:39:40,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583230 to 418998. [2024-10-24 01:39:41,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418998 states, 418997 states have (on average 1.6377539695988277) internal successors, (686214), 418997 states have internal predecessors, (686214), 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-24 01:39:42,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418998 states to 418998 states and 686214 transitions. [2024-10-24 01:39:42,081 INFO L78 Accepts]: Start accepts. Automaton has 418998 states and 686214 transitions. Word has length 226 [2024-10-24 01:39:42,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:39:42,082 INFO L471 AbstractCegarLoop]: Abstraction has 418998 states and 686214 transitions. [2024-10-24 01:39:42,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:39:42,082 INFO L276 IsEmpty]: Start isEmpty. Operand 418998 states and 686214 transitions. [2024-10-24 01:39:42,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-10-24 01:39:42,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:39:42,083 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:39:42,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 01:39:42,083 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:39:42,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:39:42,084 INFO L85 PathProgramCache]: Analyzing trace with hash -354184526, now seen corresponding path program 1 times [2024-10-24 01:39:42,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:39:42,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256210060] [2024-10-24 01:39:42,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:39:42,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:39:42,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:39:42,268 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-24 01:39:42,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:39:42,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256210060] [2024-10-24 01:39:42,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256210060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:39:42,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:39:42,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:39:42,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637115589] [2024-10-24 01:39:42,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:39:42,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:39:42,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:39:42,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:39:42,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:39:42,270 INFO L87 Difference]: Start difference. First operand 418998 states and 686214 transitions. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 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)